Build (method = -2) #dp: 257 Step-3' Graph: 37 vertices and 102 arcs (0.00s) Step-4' Graph: 6 vertices and 40 arcs (0.00s) #V4/#V3 = 0.16 #A4/#A3 = 0.39 Ready! (0.00s) Optimize a model with 15 rows, 41 columns and 117 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 13 rows, 39 columns, 113 nonzeros Variable types: 0 continuous, 39 integer (0 binary) Found heuristic solution: objective 53.0000000 Optimize a model with 13 rows, 39 columns and 113 nonzeros Presolved: 13 rows, 39 columns, 113 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.100e+01 Factor NZ : 9.100e+01 Factor Ops : 8.190e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.79801491e+02 -4.88132958e+02 5.25e+01 0.00e+00 2.09e+01 0s 1 7.69591808e+01 -1.59635699e+02 5.33e-14 6.66e-16 2.81e+00 0s 2 4.04204843e+01 -2.49244007e+01 1.78e-14 2.22e-16 7.61e-01 0s 3 2.58036144e+01 2.06733451e+01 1.42e-14 2.22e-16 5.90e-02 0s 4 2.50256317e+01 2.48885556e+01 8.82e-15 1.11e-16 1.58e-03 0s 5 2.50000026e+01 2.49999916e+01 4.67e-15 1.11e-16 1.27e-07 0s 6 2.50000000e+01 2.50000000e+01 3.31e-15 1.89e-16 1.27e-13 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 2.50000000e+01 Root relaxation: objective 2.500000e+01, 30 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 (30 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: 1 x [1, 6, 7, 8] 1 x [1, 3, 6, 8] 13 x [1, 2, 7, 8] 3 x [3, 6, 8, 9] 7 x [2, 4, 4, 5]