Build (method = -2) #dp: 1550 Step-3' Graph: 60 vertices and 183 arcs (0.01s) Step-4' Graph: 24 vertices and 111 arcs (0.01s) #V4/#V3 = 0.40 #A4/#A3 = 0.61 Ready! (0.01s) Optimize a model with 34 rows, 112 columns and 292 nonzeros Presolve removed 11 rows and 24 columns Presolve time: 0.00s Presolved: 23 rows, 88 columns, 241 nonzeros Variable types: 0 continuous, 88 integer (0 binary) Found heuristic solution: objective 101.0000000 Found heuristic solution: objective 51.0000000 Optimize a model with 23 rows, 88 columns and 241 nonzeros Presolved: 23 rows, 88 columns, 241 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.130e+02 Factor NZ : 2.280e+02 Factor Ops : 2.740e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.56490974e+02 -2.05105941e+03 5.61e+02 2.22e-16 6.00e+01 0s 1 1.80611563e+02 -7.63713698e+02 5.40e+01 4.44e-16 8.31e+00 0s 2 7.50773158e+01 -1.43201168e+02 5.33e-14 2.55e-15 1.18e+00 0s 3 3.08533974e+01 -3.92775116e+00 1.93e-14 2.50e-16 1.88e-01 0s 4 1.98395272e+01 9.40812426e+00 2.03e-14 1.73e-16 5.64e-02 0s 5 1.72691459e+01 1.60810921e+01 1.93e-14 1.60e-16 6.42e-03 0s 6 1.70002909e+01 1.69991262e+01 1.40e-14 2.22e-16 6.30e-06 0s 7 1.70000000e+01 1.70000000e+01 4.80e-14 1.79e-16 6.35e-12 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 1.70000000e+01 Root relaxation: objective 1.700000e+01, 56 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 17.0000000 17.00000 0.0% - 0s Explored 0 nodes (65 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.700000000000e+01, best bound 1.700000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.02 seconds Objective: 17 Solution: 2 x [4, 5, 6, 7, 8, 10] 1 x [3, 3, 4, 5, 6, 7] 1 x [2, 2, 5, 7, 9, 9] 6 x [4, 6, 7, 7, 8, 9] 6 x [2, 3, 4, 6, 8, 9] 1 x [1, 2, 4, 5, 6, 8]