Build (method = -2) #dp: 818 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 99.0000000 Found heuristic solution: objective 91.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 2.95977257e+02 -6.04206390e+02 7.49e+01 1.11e-16 2.13e+01 0s 1 6.58855438e+01 -2.62665695e+02 5.86e-14 2.22e-16 2.88e+00 0s 2 4.29323270e+01 -3.57307438e+00 1.42e-14 3.33e-16 3.99e-01 0s 3 2.03652169e+01 1.59862596e+01 1.51e-14 1.11e-16 3.71e-02 0s 4 2.00066754e+01 1.99826054e+01 5.57e-14 2.12e-16 2.04e-04 0s 5 2.00000000e+01 2.00000000e+01 5.36e-14 1.11e-16 2.49e-10 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 2.00000000e+01 Root relaxation: objective 2.000000e+01, 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 20.0000000 20.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+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: 9 x [1, 2, 4, 5, 6] 1 x [1, 3, 6, 9, 10] 6 x [1, 7, 8, 8, 10] 4 x [3, 9, 9, 9, 10]