Build (method = -2) #dp: 380 Step-3' Graph: 46 vertices and 128 arcs (0.00s) Step-4' Graph: 10 vertices and 56 arcs (0.00s) #V4/#V3 = 0.22 #A4/#A3 = 0.44 Ready! (0.00s) Optimize a model with 20 rows, 57 columns and 158 nonzeros Presolve removed 3 rows and 4 columns Presolve time: 0.00s Presolved: 17 rows, 53 columns, 150 nonzeros Variable types: 0 continuous, 53 integer (0 binary) Found heuristic solution: objective 99.0000000 Found heuristic solution: objective 41.0000000 Optimize a model with 17 rows, 53 columns and 150 nonzeros Presolved: 17 rows, 53 columns, 150 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.900e+01 Factor NZ : 1.530e+02 Factor Ops : 1.785e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.45621618e+02 -4.11536805e+02 9.18e+01 0.00e+00 1.53e+01 0s 1 6.37832031e+01 -1.57803440e+02 4.67e-01 3.33e-16 2.00e+00 0s 2 3.72003934e+01 -3.41141497e+01 2.04e-02 4.44e-16 6.22e-01 0s 3 2.55594057e+01 1.99683861e+01 5.20e-05 2.22e-16 4.82e-02 0s 4 2.50365012e+01 2.49328611e+01 2.81e-14 2.22e-16 8.93e-04 0s 5 2.50000092e+01 2.49999866e+01 2.20e-14 1.14e-16 1.95e-07 0s 6 2.50000000e+01 2.50000000e+01 1.05e-14 3.33e-16 1.95e-13 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 2.50000000e+01 Root relaxation: objective 2.500000e+01, 42 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 (42 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: 6 x [1, 5, 6, 10] 2 x [1, 3, 5, 5] 9 x [2, 8, 9, 10] 5 x [2, 5, 7, 10] 1 x [4, 5, 7, 8] 2 x [2, 2, 4, 5]