Build (method = -2) #dp: 306 Step-3' Graph: 42 vertices and 116 arcs (0.00s) Step-4' Graph: 10 vertices and 52 arcs (0.00s) #V4/#V3 = 0.24 #A4/#A3 = 0.45 Ready! (0.00s) Optimize a model with 19 rows, 53 columns and 146 nonzeros Presolve removed 4 rows and 6 columns Presolve time: 0.00s Presolved: 15 rows, 47 columns, 134 nonzeros Variable types: 0 continuous, 47 integer (0 binary) Found heuristic solution: objective 99.0000000 Found heuristic solution: objective 58.0000000 Optimize a model with 15 rows, 47 columns and 134 nonzeros Presolved: 15 rows, 47 columns, 134 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.100e+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.37081146e+02 -4.12150545e+02 7.94e+01 2.22e-16 1.64e+01 0s 1 6.21909834e+01 -1.50055459e+02 2.84e-14 3.33e-16 2.11e+00 0s 2 3.61991944e+01 -1.11161913e+01 2.04e-14 2.22e-16 4.63e-01 0s 3 2.51855194e+01 2.18944252e+01 2.83e-15 1.11e-16 3.20e-02 0s 4 2.50019343e+01 2.49968770e+01 5.00e-15 1.11e-16 4.91e-05 0s 5 2.50000000e+01 2.50000000e+01 8.93e-15 1.96e-16 5.63e-11 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 2.50000000e+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: 12 x [2, 3, 5, 9] 2 x [2, 3, 4, 5] 3 x [4, 6, 9, 9] 5 x [2, 7, 8, 9] 3 x [1, 4, 8, 9]