Build (method = -2) #dp: 405 Step-3' Graph: 44 vertices and 122 arcs (0.00s) Step-4' Graph: 8 vertices and 50 arcs (0.00s) #V4/#V3 = 0.18 #A4/#A3 = 0.41 Ready! (0.00s) Optimize a model with 18 rows, 51 columns and 144 nonzeros Presolve removed 3 rows and 4 columns Presolve time: 0.00s Presolved: 15 rows, 47 columns, 136 nonzeros Variable types: 0 continuous, 47 integer (0 binary) Found heuristic solution: objective 99.0000000 Found heuristic solution: objective 72.0000000 Optimize a model with 15 rows, 47 columns and 136 nonzeros Presolved: 15 rows, 47 columns, 136 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.48026381e+02 -4.29085016e+02 6.06e+01 1.11e-16 1.67e+01 0s 1 6.41422189e+01 -1.59818236e+02 3.91e-14 4.44e-16 2.22e+00 0s 2 3.96219858e+01 -1.10583952e+01 1.95e-14 2.50e-16 4.92e-01 0s 3 2.51042797e+01 2.12851168e+01 9.33e-15 1.67e-16 3.67e-02 0s 4 2.50106225e+01 2.49944307e+01 7.85e-14 4.44e-16 1.56e-04 0s 5 2.50000001e+01 2.49999999e+01 1.81e-14 3.42e-16 2.15e-09 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 2.50000001e+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: 1 x [4, 6, 7, 10] 10 x [1, 7, 9, 10] 7 x [3, 6, 8, 9] 2 x [1, 2, 3, 5] 1 x [3, 4, 5, 9] 4 x [2, 3, 3, 4]