Build (method = -2) #dp: 334 Step-3' Graph: 43 vertices and 119 arcs (0.00s) Step-4' Graph: 8 vertices and 49 arcs (0.00s) #V4/#V3 = 0.19 #A4/#A3 = 0.41 Ready! (0.00s) Optimize a model with 18 rows, 50 columns and 141 nonzeros Presolve removed 3 rows and 4 columns Presolve time: 0.00s Presolved: 15 rows, 46 columns, 133 nonzeros Variable types: 0 continuous, 46 integer (0 binary) Found heuristic solution: objective 99.0000000 Found heuristic solution: objective 47.0000000 Optimize a model with 15 rows, 46 columns and 133 nonzeros Presolved: 15 rows, 46 columns, 133 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.000e+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.59447486e+02 -4.27413403e+02 4.88e+01 0.00e+00 1.76e+01 0s 1 6.44969629e+01 -1.75237046e+02 6.75e-14 4.44e-16 2.42e+00 0s 2 3.94308996e+01 -2.12280368e+01 1.33e-14 2.22e-16 6.01e-01 0s 3 2.51769299e+01 2.03463419e+01 7.41e-15 3.33e-16 4.74e-02 0s 4 2.50118987e+01 2.49951664e+01 1.46e-14 3.78e-16 1.64e-04 0s 5 2.50000000e+01 2.50000000e+01 1.81e-14 6.66e-16 3.56e-10 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 2.50000000e+01 Root relaxation: objective 2.500000e+01, 38 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 25.0000000 25.00000 0.0% - 0s Explored 0 nodes (38 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.500000000000e+01, best bound 2.500000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 25 Solution: 3 x [2, 5, 6, 7] 7 x [1, 2, 6, 8] 5 x [1, 2, 4, 10] 6 x [1, 6, 9, 10] 1 x [2, 4, 5, 6] 2 x [3, 6, 9, 10] 1 x [3, 5, 6, 10]