Build (method = -2) #dp: 18169 Step-3' Graph: 319 vertices and 1467 arcs (0.11s) Step-4' Graph: 213 vertices and 1255 arcs (0.11s) #V4/#V3 = 0.67 #A4/#A3 = 0.86 Ready! (0.11s) Optimize a model with 231 rows, 1256 columns and 3352 nonzeros Presolve removed 41 rows and 84 columns Presolve time: 0.01s Presolved: 190 rows, 1172 columns, 3241 nonzeros Variable types: 0 continuous, 1172 integer (0 binary) Found heuristic solution: objective 156.0000000 Optimize a model with 190 rows, 1172 columns and 3241 nonzeros Presolved: 190 rows, 1172 columns, 3241 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.859e+03 Factor NZ : 5.461e+03 Factor Ops : 1.830e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.69666910e+03 -3.10890745e+04 3.18e+04 2.22e-16 1.05e+02 0s 1 7.28578404e+02 -1.39511036e+04 5.47e+03 7.77e-16 2.02e+01 0s 2 3.15960952e+02 -5.80149656e+03 1.12e+03 1.38e-14 5.00e+00 0s 3 2.17925403e+02 -1.30444992e+03 1.80e+02 5.55e-15 9.14e-01 0s 4 1.88545623e+02 -3.43563573e+02 4.91e-01 3.22e-15 2.26e-01 0s 5 1.58407058e+02 -2.78936796e+02 3.46e-01 2.66e-15 1.85e-01 0s 6 1.05702629e+02 -1.66305267e+02 1.93e-01 1.22e-15 1.15e-01 0s 7 6.65773507e+01 -8.70908503e+01 1.03e-01 8.88e-16 6.51e-02 0s 8 5.15159376e+01 -5.38011801e+01 6.55e-02 7.33e-16 4.46e-02 0s 9 4.09146397e+01 -1.90022469e+01 4.44e-02 8.26e-16 2.54e-02 0s 10 3.49199052e+01 1.03158636e+01 2.81e-02 1.09e-15 1.04e-02 0s 11 3.14527078e+01 2.18610774e+01 1.43e-02 6.69e-16 4.06e-03 0s 12 3.00324661e+01 2.58213870e+01 8.39e-03 7.93e-16 1.78e-03 0s 13 2.98738141e+01 2.68939159e+01 6.93e-03 8.31e-16 1.26e-03 0s 14 2.86685101e+01 2.84735984e+01 4.61e-06 9.99e-16 8.25e-05 0s 15 2.85714822e+01 2.85704352e+01 4.98e-09 6.82e-16 4.43e-07 0s 16 2.85714286e+01 2.85714276e+01 5.68e-14 8.88e-16 4.43e-10 0s 17 2.85714286e+01 2.85714286e+01 2.42e-14 6.66e-16 1.01e-15 0s Barrier solved model in 17 iterations and 0.02 seconds Optimal objective 2.85714286e+01 Root relaxation: objective 2.857143e+01, 791 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 156.00000 28.57143 81.7% - 0s H 0 0 29.0000000 28.57143 1.48% - 0s Explored 0 nodes (1291 simplex iterations) in 0.09 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.09 seconds Total run time: 0.21 seconds Objective: 29 Solution: 3 x [2, 7, 7, 8, 10, 13, 18] 7 x [3, 6, 8, 14, 15, 16, 16] 2 x [2, 5, 7, 7, 10, 13, 18] 7 x [1, 5, 10, 13, 17, 18, 18] 1 x [4, 6, 12, 13, 17] 2 x [3, 4, 4, 4, 12, 14, 17] 1 x [2, 7, 13, 17, 18, 18] 1 x [3, 6, 9, 11, 18, 18, 18] 5 x [6, 9, 9, 9, 11, 12, 13]