Build (method = -2) #dp: 306 Step-3' Graph: 45 vertices and 125 arcs (0.00s) Step-4' Graph: 10 vertices and 55 arcs (0.00s) #V4/#V3 = 0.22 #A4/#A3 = 0.44 Ready! (0.00s) Optimize a model with 20 rows, 56 columns and 155 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 18 rows, 54 columns, 151 nonzeros Variable types: 0 continuous, 54 integer (0 binary) Found heuristic solution: objective 99.0000000 Found heuristic solution: objective 97.0000000 Optimize a model with 18 rows, 54 columns and 151 nonzeros Presolved: 18 rows, 54 columns, 151 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 6.300e+01 Factor NZ : 1.710e+02 Factor Ops : 2.109e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.51456417e+02 -4.01348085e+02 9.70e+01 2.22e-16 1.55e+01 0s 1 6.51790414e+01 -1.55697216e+02 1.10e+00 2.22e-16 2.00e+00 0s 2 4.25922745e+01 -4.87210813e+01 1.43e-01 2.22e-16 7.89e-01 0s 3 2.81085667e+01 1.89173665e+01 1.47e-14 1.11e-16 7.79e-02 0s 4 2.51337565e+01 2.43755326e+01 6.49e-13 2.22e-16 6.43e-03 0s 5 2.50005682e+01 2.49992196e+01 1.15e-14 1.11e-16 1.14e-05 0s 6 2.50000000e+01 2.50000000e+01 5.14e-15 2.22e-16 1.21e-11 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 2.50000000e+01 Root relaxation: objective 2.500000e+01, 41 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 (41 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 [1, 3, 5, 6] 2 x [4, 5, 5, 9] 1 x [1, 2, 3, 5] 1 x [1, 2, 5, 9] 10 x [5, 8, 9, 10] 8 x [1, 3, 7, 9]