Build (method = -2) #dp: 281 Step-3' Graph: 43 vertices and 122 arcs (0.00s) Step-4' Graph: 10 vertices and 56 arcs (0.00s) #V4/#V3 = 0.23 #A4/#A3 = 0.46 Ready! (0.00s) Optimize a model with 20 rows, 57 columns and 155 nonzeros Presolve removed 5 rows and 9 columns Presolve time: 0.00s Presolved: 15 rows, 48 columns, 135 nonzeros Variable types: 0 continuous, 48 integer (0 binary) Found heuristic solution: objective 98.0000000 Found heuristic solution: objective 64.0000000 Optimize a model with 15 rows, 48 columns and 135 nonzeros Presolved: 15 rows, 48 columns, 135 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 3.91659936e+02 -7.12583385e+02 9.51e+01 1.11e-16 2.88e+01 0s 1 1.07551455e+02 -2.36922023e+02 3.18e+00 5.55e-16 3.75e+00 0s 2 5.12428560e+01 -2.02329234e+01 1.83e-01 4.66e-15 6.90e-01 0s 3 2.61426308e+01 1.91254101e+01 6.53e-04 2.22e-16 6.68e-02 0s 4 2.50589405e+01 2.47785792e+01 3.08e-05 2.22e-16 2.67e-03 0s 5 2.50000262e+01 2.49999343e+01 4.52e-09 1.11e-16 8.76e-07 0s 6 2.50000000e+01 2.50000000e+01 2.90e-14 2.22e-16 8.76e-13 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 2.50000000e+01 Root relaxation: objective 2.500000e+01, 36 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 25.00000 0 4 64.00000 25.00000 60.9% - 0s H 0 0 26.0000000 25.00000 3.85% - 0s H 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: 9 x [2, 3, 4, 6] 1 x [4, 6, 7, 10] 7 x [1, 3, 4, 10] 4 x [1, 2, 2, 6] 1 x [1, 5, 7, 9] 1 x [1, 5, 5, 8] 2 x [1, 6, 7, 9]