Build (method = -2) #dp: 21167 Step-3' Graph: 397 vertices and 1713 arcs (0.11s) Step-4' Graph: 279 vertices and 1480 arcs (0.11s) #V4/#V3 = 0.70 #A4/#A3 = 0.86 Ready! (0.11s) Optimize a model with 298 rows, 1481 columns and 3892 nonzeros Presolve removed 42 rows and 83 columns Presolve time: 0.01s Presolved: 256 rows, 1398 columns, 3790 nonzeros Variable types: 0 continuous, 1398 integer (0 binary) Found heuristic solution: objective 180.0000000 Optimize a model with 256 rows, 1398 columns and 3790 nonzeros Presolved: 256 rows, 1398 columns, 3790 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.295e+03 Factor NZ : 7.459e+03 Factor Ops : 2.655e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.69704087e+03 -3.78838201e+04 3.73e+04 2.22e-16 1.07e+02 0s 1 6.77285061e+02 -1.64480517e+04 5.50e+03 6.66e-16 1.81e+01 0s 2 3.52840348e+02 -5.98790361e+03 1.44e+03 7.77e-16 4.90e+00 0s 3 2.22425012e+02 -1.41166585e+03 2.15e+02 7.95e-14 8.70e-01 0s 4 1.96489252e+02 -2.10121375e+02 1.39e+01 1.42e-14 1.53e-01 0s 5 1.71310316e+02 -2.22191749e+02 1.12e+01 1.35e-14 1.48e-01 0s 6 1.40126244e+02 -1.18640718e+02 7.44e+00 8.77e-15 9.61e-02 0s 7 1.31879963e+02 -1.16560804e+02 6.89e+00 8.22e-15 9.21e-02 0s 8 1.13995350e+02 -9.58711500e+01 5.86e+00 7.55e-15 7.77e-02 0s 9 6.24531226e+01 -4.61246059e+01 2.65e+00 4.00e-15 3.99e-02 0s 10 4.56397416e+01 -1.29321683e+01 1.62e+00 1.55e-15 2.15e-02 0s 11 3.89116012e+01 2.40374460e+00 1.12e+00 1.43e-15 1.34e-02 0s 12 3.42906812e+01 1.28733403e+01 7.52e-01 1.19e-15 7.82e-03 0s 13 3.16290221e+01 2.11085396e+01 4.53e-01 1.13e-15 3.84e-03 0s 14 2.94090041e+01 2.60554715e+01 1.32e-01 1.03e-15 1.21e-03 0s 15 2.88087922e+01 2.83704782e+01 2.36e-03 1.23e-15 1.56e-04 0s 16 2.85717118e+01 2.85694428e+01 1.94e-13 9.65e-16 8.06e-07 0s 17 2.85714289e+01 2.85714266e+01 1.73e-13 1.25e-15 8.06e-10 0s 18 2.85714286e+01 2.85714286e+01 3.01e-13 1.22e-15 1.70e-15 0s Barrier solved model in 18 iterations and 0.02 seconds Optimal objective 2.85714286e+01 Root relaxation: objective 2.857143e+01, 907 iterations, 0.03 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 28.57143 0 27 180.00000 28.57143 84.1% - 0s H 0 0 29.0000000 28.57143 1.48% - 0s Explored 0 nodes (1361 simplex iterations) in 0.10 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.900000000000e+01, best bound 2.900000000000e+01, gap 0.0% Preprocessing time: 0.12 seconds Gurobi run time: 0.10 seconds Total run time: 0.23 seconds Objective: 29 Solution: 8 x [4, 5, 10, 11, 12, 14, 15] 1 x [5, 10, 11, 11, 12, 14] 3 x [3, 3, 3, 5, 6, 8, 9] 1 x [2, 3, 3, 3, 3, 5, 13] 1 x [1, 4, 5, 8, 11, 11, 17] 1 x [1, 4, 15, 18, 18, 18] 3 x [1, 4, 15, 18, 18, 18, 19] 2 x [1, 2, 3, 13, 16, 16, 18] 2 x [2, 3, 12, 13, 16, 16, 18] 1 x [2, 12, 16, 16, 17, 18] 2 x [7, 8, 10, 10, 10, 16, 16] 4 x [1, 1, 4, 4, 8, 11, 19]