Build (method = -2) #dp: 5304 Step-3' Graph: 177 vertices and 1198 arcs (0.02s) Step-4' Graph: 160 vertices and 1164 arcs (0.02s) #V4/#V3 = 0.90 #A4/#A3 = 0.97 Ready! (0.02s) Optimize a model with 180 rows, 1165 columns and 3185 nonzeros Presolve removed 29 rows and 58 columns Presolve time: 0.01s Presolved: 151 rows, 1107 columns, 3106 nonzeros Variable types: 0 continuous, 1107 integer (0 binary) Found heuristic solution: objective 326.0000000 Optimize a model with 151 rows, 1107 columns and 3106 nonzeros Presolved: 151 rows, 1107 columns, 3106 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.911e+03 Factor NZ : 5.412e+03 Factor Ops : 2.294e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.29217552e+03 -3.38917638e+04 3.29e+04 2.22e-16 1.49e+02 0s 1 1.46948492e+03 -1.66222841e+04 5.36e+03 5.55e-16 2.72e+01 0s 2 5.57427590e+02 -6.22857225e+03 9.04e+02 1.67e-15 5.68e+00 0s 3 3.46198476e+02 -1.19473701e+03 4.62e+01 4.22e-15 7.76e-01 0s 4 2.32632975e+02 -4.72648040e+02 5.32e-02 1.67e-15 3.16e-01 0s 5 1.45601645e+02 -2.52540324e+02 2.45e-02 1.11e-15 1.78e-01 0s 6 1.05904060e+02 -1.16166692e+02 1.64e-02 6.66e-16 9.94e-02 0s 7 7.45524746e+01 -4.50586512e+01 9.71e-03 3.33e-16 5.35e-02 0s 8 6.44338044e+01 1.45267053e+01 4.33e-03 2.22e-16 2.23e-02 0s 9 5.63966608e+01 4.30254887e+01 1.63e-03 3.33e-16 5.99e-03 0s 10 5.10768282e+01 4.83815928e+01 1.51e-04 2.22e-16 1.21e-03 0s 11 5.06527917e+01 5.05298027e+01 1.55e-05 4.44e-16 5.51e-05 0s 12 5.05714422e+01 5.05714215e+01 2.95e-09 3.33e-16 9.30e-09 0s 13 5.05714286e+01 5.05714286e+01 6.53e-12 3.33e-16 1.00e-14 0s Barrier solved model in 13 iterations and 0.01 seconds Optimal objective 5.05714286e+01 Root relaxation: objective 5.057143e+01, 796 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 50.57143 0 11 326.00000 50.57143 84.5% - 0s H 0 0 53.0000000 50.57143 4.58% - 0s H 0 0 52.0000000 50.57143 2.75% - 0s H 0 0 51.0000000 50.57143 0.84% - 0s Explored 0 nodes (1696 simplex iterations) in 0.12 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 5.100000000000e+01, best bound 5.100000000000e+01, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.12 seconds Total run time: 0.15 seconds Objective: 51 Solution: 3 x [5, 10, 13, 13, 13, 14, 16] 9 x [1, 3, 5, 8, 9, 9, 11] 1 x [10, 13, 13, 13, 14, 17] 8 x [1, 15, 15, 16, 17, 18, 20] 1 x [6, 7, 10, 13, 13, 17, 18] 2 x [3, 7, 13, 13, 13, 17, 18] 5 x [1, 2, 3, 8, 11, 11, 17] 3 x [6, 7, 7, 10, 13, 13, 19] 1 x [2, 2, 2, 7, 7, 7, 19] 2 x [1, 15, 15, 18, 19, 19, 20] 1 x [1, 15, 18, 19, 19] 5 x [4, 7, 8, 9, 11, 12, 18] 4 x [11, 12, 13, 16, 16, 18, 20] 6 x [3, 7, 15, 15, 20, 20, 20]