Build (method = -2) #dp: 87 Step-3' Graph: 21 vertices and 56 arcs (0.00s) Step-4' Graph: 5 vertices and 24 arcs (0.00s) #V4/#V3 = 0.24 #A4/#A3 = 0.43 Ready! (0.00s) Optimize a model with 12 rows, 25 columns and 69 nonzeros Presolve removed 3 rows and 3 columns Presolve time: 0.00s Presolved: 9 rows, 22 columns, 62 nonzeros Variable types: 0 continuous, 22 integer (0 binary) Found heuristic solution: objective 267.0000000 Found heuristic solution: objective 265.0000000 Optimize a model with 9 rows, 22 columns and 62 nonzeros Presolved: 9 rows, 22 columns, 62 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.100e+01 Factor NZ : 4.500e+01 Factor Ops : 2.850e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.12129489e+02 -1.17694518e+03 1.46e+02 1.11e-16 8.79e+01 0s 1 2.79967040e+02 -2.31406562e+02 6.15e+00 2.22e-16 1.16e+01 0s 2 1.13643751e+02 2.87038058e+01 2.08e-01 4.44e-16 1.71e+00 0s 3 9.22255986e+01 7.66226922e+01 2.37e-03 1.11e-16 3.12e-01 0s 4 8.97510464e+01 8.87529606e+01 4.70e-14 2.78e-17 2.00e-02 0s 5 8.96667190e+01 8.96661277e+01 3.50e-14 2.22e-16 1.18e-05 0s 6 8.96666667e+01 8.96666667e+01 7.73e-14 2.22e-16 1.19e-11 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 8.96666667e+01 Root relaxation: objective 8.966667e+01, 16 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 89.66667 0 4 265.00000 89.66667 66.2% - 0s H 0 0 90.0000000 89.66667 0.37% - 0s Explored 0 nodes (19 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 9.000000000000e+01, best bound 9.000000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 90 Solution: 3 x [2, 3, 7] 3 x [2, 3, 6] 6 x [1, 2, 3] 16 x [2, 3, 4] 50 x [2, 2, 3] 11 x [2, 3, 3] 1 x [2, 5]