Build (method = -2) #dp: 794 Step-3' Graph: 58 vertices and 163 arcs (0.00s) Step-4' Graph: 13 vertices and 73 arcs (0.00s) #V4/#V3 = 0.22 #A4/#A3 = 0.45 Ready! (0.00s) Optimize a model with 23 rows, 74 columns and 204 nonzeros Presolve removed 4 rows and 6 columns Presolve time: 0.00s Presolved: 19 rows, 68 columns, 193 nonzeros Variable types: 0 continuous, 68 integer (0 binary) Found heuristic solution: objective 99.0000000 Found heuristic solution: objective 46.0000000 Optimize a model with 19 rows, 68 columns and 193 nonzeros Presolved: 19 rows, 68 columns, 193 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 7.700e+01 Factor NZ : 1.900e+02 Factor Ops : 2.470e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.83512581e+02 -5.73707337e+02 1.47e+02 2.22e-16 1.81e+01 0s 1 6.87160454e+01 -2.44356777e+02 3.16e+00 4.44e-16 2.39e+00 0s 2 4.10318033e+01 -4.22761992e+01 3.52e-02 1.67e-16 5.79e-01 0s 3 2.23338406e+01 1.01626429e+01 1.42e-05 2.22e-16 8.34e-02 0s 4 2.03052504e+01 1.94301404e+01 1.91e-06 2.22e-16 5.99e-03 0s 5 2.00007097e+01 1.99972356e+01 2.40e-09 2.17e-16 2.38e-05 0s 6 2.00000000e+01 2.00000000e+01 4.78e-15 2.22e-16 2.50e-11 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 2.00000000e+01 Root relaxation: objective 2.000000e+01, 55 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 (55 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: 1 x [4, 5, 5, 9, 10] 8 x [1, 4, 5, 10, 10] 2 x [1, 3, 7, 8, 9] 5 x [1, 2, 3, 5, 7] 2 x [1, 3, 4, 5, 6] 2 x [1, 3, 4, 8, 9]