Build (method = -2) #dp: 9173 Step-3' Graph: 329 vertices and 4225 arcs (0.07s) Step-4' Graph: 215 vertices and 3910 arcs (0.07s) #V4/#V3 = 0.65 #A4/#A3 = 0.93 Ready! (0.07s) Optimize a model with 262 rows, 3911 columns and 11308 nonzeros Presolve removed 9 rows and 10 columns Presolve time: 0.05s Presolved: 253 rows, 3901 columns, 11307 nonzeros Variable types: 0 continuous, 3901 integer (871 binary) Found heuristic solution: objective 95.0000000 Found heuristic solution: objective 84.0000000 Optimize a model with 253 rows, 3901 columns and 11307 nonzeros Presolved: 253 rows, 3901 columns, 11307 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 6.311e+03 Factor NZ : 1.466e+04 (roughly 2 MBytes of memory) Factor Ops : 1.126e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.13353243e+03 -6.18075706e+04 4.71e+04 1.75e-01 8.24e+01 0s 1 2.08121049e+03 -1.60477655e+04 9.59e+03 8.88e-16 1.68e+01 0s 2 4.30297299e+02 -7.65798953e+03 7.68e+02 1.11e-15 2.10e+00 0s 3 2.63495986e+02 -2.02563767e+03 1.50e+02 1.78e-15 4.46e-01 0s 4 1.45364914e+02 -7.03204927e+02 3.11e+01 4.22e-15 1.33e-01 0s 5 1.39102752e+02 -3.07182405e+02 2.84e+01 1.44e-15 7.30e-02 0s 6 1.21224552e+02 -2.08116083e+02 1.87e+01 1.11e-15 5.04e-02 0s 7 1.12316590e+02 -1.70031490e+02 1.59e+01 7.04e-16 4.27e-02 0s 8 7.84436223e+01 -1.17110568e+02 7.14e+00 6.97e-16 2.77e-02 0s 9 5.14876603e+01 -4.99393597e+01 3.82e+00 5.89e-16 1.42e-02 0s 10 4.49395187e+01 -2.59432764e+01 3.05e+00 5.55e-16 9.96e-03 0s 11 2.94145966e+01 -9.59920356e+00 1.53e+00 7.37e-16 5.35e-03 0s 12 2.60400222e+01 -2.04091374e+00 8.58e-01 7.82e-16 3.76e-03 0s 13 2.55908569e+01 2.97985204e+00 7.17e-01 7.59e-16 3.01e-03 0s 14 2.32299664e+01 1.47600192e+01 1.92e-01 6.85e-16 1.10e-03 0s 15 2.22721699e+01 1.90802029e+01 6.04e-02 8.88e-16 4.11e-04 0s 16 2.16619906e+01 2.06795622e+01 9.16e-03 5.55e-16 1.26e-04 0s 17 2.14686119e+01 2.11903975e+01 8.49e-04 6.66e-16 3.55e-05 0s 18 2.14320267e+01 2.13370480e+01 2.31e-04 6.67e-16 1.21e-05 0s 19 2.14163226e+01 2.14063624e+01 2.34e-05 6.66e-16 1.27e-06 0s 20 2.14139655e+01 2.14138950e+01 6.90e-08 6.66e-16 9.01e-09 0s 21 2.14139535e+01 2.14139534e+01 4.19e-13 1.33e-15 9.01e-12 0s Barrier solved model in 21 iterations and 0.07 seconds Optimal objective 2.14139535e+01 Root relaxation: objective 2.141395e+01, 1450 iterations, 0.09 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 21.41395 0 67 84.00000 21.41395 74.5% - 0s H 0 0 23.0000000 21.41395 6.90% - 0s H 0 0 22.0000000 21.41395 2.66% - 0s Explored 0 nodes (3119 simplex iterations) in 0.41 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.200000000000e+01, best bound 2.200000000000e+01, gap 0.0% Preprocessing time: 0.09 seconds Gurobi run time: 0.41 seconds Total run time: 0.50 seconds Objective: 22 Solution: 1 x [36, 37, 40, 46, 47] 2 x [33, 42, 44, 45, 45] 1 x [32, 36, 37, 39, 43] 2 x [31, 34, 37, 37, 42] 1 x [33, 35, 38, 40, 41] 1 x [33, 35, 36, 39, 41] 1 x [13, 24, 26, 30, 40] 1 x [3, 7, 27, 29, 30] 1 x [1, 2, 14, 22, 29, 30] 1 x [8, 9, 12, 19, 19, 29] 1 x [5, 6, 16, 18, 29] 1 x [4, 5, 11, 21, 28, 28] 1 x [4, 5, 11, 25, 25, 27] 1 x [8, 9, 17, 17, 19, 26] 1 x [10, 13, 14, 14, 17, 26] 1 x [1, 2, 22, 24, 24, 25] 1 x [4, 12, 15, 15, 25, 25] 1 x [8, 9, 13, 19, 23, 24] 1 x [4, 12, 15, 20, 21, 24] 1 x [3, 3, 10, 24, 24]