Build (method = -2) #dp: 604 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 99.0000000 Found heuristic solution: objective 89.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.87544209e+02 -5.96804396e+02 8.02e+01 1.11e-16 2.28e+01 0s 1 6.53380639e+01 -2.51549723e+02 3.20e-14 3.33e-16 3.05e+00 0s 2 4.16633062e+01 -1.73945517e+00 2.13e-14 2.34e-16 4.10e-01 0s 3 2.04265619e+01 1.62110007e+01 8.88e-15 3.33e-16 3.94e-02 0s 4 2.00023959e+01 1.99954449e+01 3.48e-14 3.33e-16 6.50e-05 0s 5 2.00000000e+01 2.00000000e+01 5.46e-14 3.33e-16 6.62e-11 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 2.00000000e+01 Root relaxation: objective 2.000000e+01, 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 20.0000000 20.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+01, best bound 2.000000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 20 Solution: 11 x [1, 2, 4, 5, 6] 6 x [3, 5, 7, 8, 9] 2 x [1, 2, 3, 7, 8] 1 x [1, 1, 1, 2, 7]