Build (method = -2) #dp: 12483 Step-3' Graph: 344 vertices and 1891 arcs (0.06s) Step-4' Graph: 300 vertices and 1803 arcs (0.06s) #V4/#V3 = 0.87 #A4/#A3 = 0.95 Ready! (0.06s) Optimize a model with 320 rows, 1804 columns and 4822 nonzeros Presolve removed 27 rows and 49 columns Presolve time: 0.02s Presolved: 293 rows, 1755 columns, 4791 nonzeros Variable types: 0 continuous, 1755 integer (0 binary) Found heuristic solution: objective 687.0000000 Optimize a model with 293 rows, 1755 columns and 4791 nonzeros Presolved: 293 rows, 1755 columns, 4791 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.215e+03 Factor NZ : 1.224e+04 Factor Ops : 6.688e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.81330645e+03 -1.36053996e+05 1.26e+05 2.22e-16 3.37e+02 0s 1 2.51638556e+03 -6.71772219e+04 1.81e+04 8.10e-15 5.83e+01 0s 2 1.40262298e+03 -2.63734008e+04 5.22e+03 4.22e-15 1.76e+01 0s 3 9.02875155e+02 -7.11996790e+03 7.18e+02 4.44e-15 3.29e+00 0s 4 8.00546463e+02 -2.21823871e+03 1.05e+02 3.41e-15 9.53e-01 0s 5 6.88791524e+02 -1.54751689e+03 7.23e+01 3.15e-15 6.92e-01 0s 6 5.26482838e+02 -1.13127207e+03 4.79e+01 3.90e-15 5.04e-01 0s 7 4.27942224e+02 -7.35047598e+02 3.72e+01 3.10e-15 3.53e-01 0s 8 2.65052691e+02 -4.75631873e+02 1.97e+01 3.24e-15 2.21e-01 0s 9 1.83772547e+02 -1.40524091e+02 9.69e+00 3.98e-15 9.60e-02 0s 10 1.45756381e+02 2.16065226e+01 4.52e+00 4.22e-15 3.66e-02 0s 11 1.32086970e+02 6.25209397e+01 2.24e+00 4.55e-15 2.03e-02 0s 12 1.27557580e+02 9.82681891e+01 1.57e+00 4.36e-15 8.62e-03 0s 13 1.27555050e+02 1.08318802e+02 1.34e+00 4.31e-15 5.69e-03 0s 14 1.21854632e+02 1.16968896e+02 4.24e-01 4.62e-15 1.45e-03 0s 15 1.19914328e+02 1.19308181e+02 2.87e-03 4.13e-15 1.72e-04 0s 16 1.19571866e+02 1.19556359e+02 2.60e-12 4.40e-15 4.39e-06 0s 17 1.19571429e+02 1.19571429e+02 3.42e-12 5.76e-15 2.51e-11 0s Barrier solved model in 17 iterations and 0.03 seconds Optimal objective 1.19571429e+02 Root relaxation: objective 1.195714e+02, 1225 iterations, 0.04 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 119.57143 0 30 687.00000 119.57143 82.6% - 0s H 0 0 120.0000000 119.57143 0.36% - 0s Explored 0 nodes (2842 simplex iterations) in 0.18 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.200000000000e+02, best bound 1.200000000000e+02, gap 0.0% Preprocessing time: 0.07 seconds Gurobi run time: 0.18 seconds Total run time: 0.25 seconds Objective: 120 Solution: 4 x [2, 3, 7, 7, 16, 17, 17] 4 x [3, 3, 5, 10, 13, 13, 16] 11 x [4, 5, 12, 13, 13, 17, 17] 5 x [4, 5, 12, 13, 13, 13, 13] 2 x [5, 8, 8, 13, 16, 18, 20] 16 x [1, 2, 7, 13, 15, 18, 20] 4 x [5, 6, 6, 10, 14, 16, 18] 43 x [2, 6, 7, 8, 14, 15, 18] 1 x [2, 7, 7, 14, 17, 17, 20] 1 x [5, 10, 16, 20, 20] 5 x [2, 4, 9, 13, 13, 20, 20] 20 x [6, 6, 7, 9, 11, 20, 20] 3 x [2, 4, 5, 13, 13, 15, 19] 1 x [5, 5, 8, 13, 16, 19]