Build (method = -2) #dp: 636 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 964.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 3.12422781e+03 -5.97019286e+03 9.13e+02 0.00e+00 2.49e+02 0s 1 7.38768577e+02 -2.49498858e+03 3.01e+01 4.44e-16 3.45e+01 0s 2 3.88013198e+02 -5.90502114e+01 1.13e-02 8.88e-16 4.22e+00 0s 3 2.09696359e+02 1.51572306e+02 3.71e-04 3.33e-16 5.43e-01 0s 4 2.00228811e+02 1.99288280e+02 1.86e-13 2.22e-16 8.79e-03 0s 5 2.00000036e+02 1.99999878e+02 2.35e-13 2.22e-16 1.48e-06 0s 6 2.00000000e+02 2.00000000e+02 3.34e-14 1.11e-16 1.51e-12 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 2.00000000e+02 Root relaxation: objective 2.000000e+02, 40 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 (40 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: 35 x [2, 4, 5, 6, 7] 1 x [2, 2, 5, 5, 7] 98 x [1, 5, 5, 6, 8] 4 x [2, 2, 4, 5, 8] 10 x [1, 2, 2, 5, 8] 1 x [2, 2, 2, 5, 5] 17 x [1, 2, 2, 3, 4] 34 x [1, 2, 2, 4, 9]