Build (method = -2) #dp: 17363 Step-3' Graph: 219 vertices and 823 arcs (0.09s) Step-4' Graph: 118 vertices and 621 arcs (0.09s) #V4/#V3 = 0.54 #A4/#A3 = 0.75 Ready! (0.09s) Optimize a model with 135 rows, 622 columns and 1640 nonzeros Presolve removed 26 rows and 52 columns Presolve time: 0.01s Presolved: 109 rows, 570 columns, 1561 nonzeros Variable types: 0 continuous, 570 integer (44 binary) Found heuristic solution: objective 186.0000000 Optimize a model with 109 rows, 570 columns and 1561 nonzeros Presolved: 109 rows, 570 columns, 1561 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 8.960e+02 Factor NZ : 2.682e+03 Factor Ops : 7.682e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.77110493e+03 -1.22480358e+04 1.11e+04 2.22e-16 7.13e+01 0s 1 3.90359017e+02 -4.08826722e+03 1.34e+03 6.66e-16 1.01e+01 0s 2 1.83525571e+02 -1.41157123e+03 2.10e+02 7.22e-16 2.15e+00 0s 3 1.17453477e+02 -2.01647982e+02 1.40e+01 6.55e-15 3.05e-01 0s 4 6.17380800e+01 -5.95628387e+01 5.30e+00 3.00e-15 1.12e-01 0s 5 4.44696484e+01 -1.96442249e+01 3.05e+00 1.11e-15 5.88e-02 0s 6 3.66929139e+01 4.84245466e-01 1.68e+00 6.66e-16 3.28e-02 0s 7 3.21150867e+01 1.09368770e+01 9.33e-01 4.44e-16 1.90e-02 0s 8 3.00624391e+01 2.28273133e+01 3.91e-01 3.08e-16 6.46e-03 0s 9 2.95640476e+01 2.51585553e+01 2.40e-01 2.91e-16 3.90e-03 0s 10 2.86676773e+01 2.83834856e+01 1.02e-04 3.39e-16 2.46e-04 0s 11 2.85715532e+01 2.85711043e+01 3.80e-14 4.44e-16 3.88e-07 0s 12 2.85714287e+01 2.85714282e+01 9.33e-14 4.44e-16 3.88e-10 0s 13 2.85714286e+01 2.85714286e+01 4.02e-14 3.65e-16 5.14e-16 0s Barrier solved model in 13 iterations and 0.01 seconds Optimal objective 2.85714286e+01 Root relaxation: objective 2.857143e+01, 389 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 28.57143 0 13 186.00000 28.57143 84.6% - 0s H 0 0 29.0000000 28.57143 1.48% - 0s Explored 0 nodes (602 simplex iterations) in 0.03 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.10 seconds Gurobi run time: 0.03 seconds Total run time: 0.13 seconds Objective: 29 Solution: 2 x [2, 4, 5, 6, 6, 7, 12] 1 x [1, 1, 1, 1, 1, 2, 13] 1 x [4, 6, 8, 10, 12, 14, 16] 1 x [8, 10, 12, 14] 2 x [2, 7, 8, 12, 14, 15, 16] 1 x [2, 2, 2, 2, 2, 8, 17] 5 x [4, 7, 7, 8, 12, 14, 17] 1 x [3, 4, 4, 4, 8, 12, 17] 6 x [4, 4, 6, 11, 11, 12, 15] 9 x [3, 4, 6, 8, 9, 15, 17]