Build (method = -2) #dp: 857 Step-3' Graph: 52 vertices and 145 arcs (0.00s) Step-4' Graph: 7 vertices and 55 arcs (0.00s) #V4/#V3 = 0.13 #A4/#A3 = 0.38 Ready! (0.00s) Optimize a model with 17 rows, 56 columns and 162 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 15 rows, 54 columns, 158 nonzeros Variable types: 0 continuous, 54 integer (0 binary) Found heuristic solution: objective 999.0000000 Found heuristic solution: objective 871.0000000 Optimize a model with 15 rows, 54 columns and 158 nonzeros Presolved: 15 rows, 54 columns, 158 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.700e+01 Factor NZ : 1.200e+02 Factor Ops : 1.240e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.12691543e+03 -6.04349364e+03 8.16e+02 0.00e+00 2.27e+02 0s 1 6.93644397e+02 -2.71431829e+03 8.11e+00 3.33e-16 3.07e+01 0s 2 4.58958724e+02 -4.09891112e+02 5.73e-01 7.77e-16 7.50e+00 0s 3 2.27530903e+02 1.09030727e+02 8.11e-04 2.22e-16 1.00e+00 0s 4 2.02523845e+02 1.95912988e+02 6.32e-05 2.22e-16 5.60e-02 0s 5 2.00001468e+02 1.99989883e+02 1.48e-13 2.22e-16 9.82e-05 0s 6 2.00000000e+02 2.00000000e+02 3.34e-14 2.22e-16 9.93e-11 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 2.00000000e+02 Root relaxation: objective 2.000000e+02, 45 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 (45 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: 90 x [2, 3, 6, 7, 8] 4 x [1, 1, 5, 6, 8] 30 x [1, 4, 8, 9, 9] 1 x [1, 1, 5, 8, 9] 1 x [1, 1, 8, 9, 9] 3 x [1, 1, 3, 5, 8] 55 x [1, 2, 4, 9, 10] 16 x [1, 1, 3, 5, 9]