Build (method = -2) #dp: 626 Step-3' Graph: 47 vertices and 130 arcs (0.00s) Step-4' Graph: 7 vertices and 50 arcs (0.00s) #V4/#V3 = 0.15 #A4/#A3 = 0.38 Ready! (0.00s) Optimize a model with 16 rows, 51 columns and 147 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 14 rows, 49 columns, 143 nonzeros Variable types: 0 continuous, 49 integer (0 binary) Found heuristic solution: objective 999.0000000 Found heuristic solution: objective 833.0000000 Optimize a model with 14 rows, 49 columns and 143 nonzeros Presolved: 14 rows, 49 columns, 143 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.200e+01 Factor NZ : 1.050e+02 Factor Ops : 1.015e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.94487067e+03 -5.96868384e+03 8.33e+02 0.00e+00 2.34e+02 0s 1 6.53863416e+02 -2.51454819e+03 4.55e-13 4.44e-16 3.05e+01 0s 2 4.19324754e+02 -7.41380056e+01 1.63e-13 3.16e-16 4.66e+00 0s 3 2.06388176e+02 1.51902011e+02 5.77e-14 2.22e-16 5.09e-01 0s 4 2.00299528e+02 1.99763229e+02 1.44e-13 1.11e-16 5.01e-03 0s 5 2.00000003e+02 1.99999995e+02 1.96e-12 1.11e-16 7.32e-08 0s 6 2.00000000e+02 2.00000000e+02 9.41e-14 3.34e-16 8.12e-14 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 2.00000000e+02 Root relaxation: objective 2.000000e+02, 41 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 200.0000000 200.00000 0.0% - 0s Explored 0 nodes (41 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.000000000000e+02, best bound 2.000000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 200 Solution: 7 x [1, 3, 4, 5, 8] 48 x [2, 4, 6, 7, 8] 1 x [3, 4, 7, 8, 8] 10 x [2, 4, 5, 8, 8] 3 x [4, 5, 8, 8, 8] 27 x [1, 5, 8, 8, 8] 104 x [1, 3, 4, 5, 9]