Build (method = -2) #dp: 131 Step-3' Graph: 26 vertices and 71 arcs (0.00s) Step-4' Graph: 22 vertices and 63 arcs (0.00s) #V4/#V3 = 0.85 #A4/#A3 = 0.89 Ready! (0.00s) Optimize a model with 32 rows, 64 columns and 152 nonzeros Presolve removed 13 rows and 21 columns Presolve time: 0.00s Presolved: 19 rows, 43 columns, 125 nonzeros Variable types: 0 continuous, 43 integer (0 binary) Optimize a model with 19 rows, 43 columns and 125 nonzeros Presolved: 19 rows, 43 columns, 125 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 8.700e+01 Factor NZ : 1.900e+02 Factor Ops : 2.470e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.98138780e+02 -3.22809181e+02 8.66e+02 5.55e-17 3.39e+01 0s 1 2.31601015e+02 -9.53482846e+01 1.07e+02 1.78e-02 6.22e+00 0s 2 2.07975233e+02 1.59140544e+02 2.30e+01 3.55e-04 8.16e-01 0s 3 2.08067381e+02 2.05375568e+02 5.56e-12 7.98e-17 3.45e-02 0s 4 2.08000069e+02 2.07997376e+02 3.48e-12 1.11e-16 3.45e-05 0s 5 2.08000000e+02 2.08000000e+02 2.84e-13 3.33e-16 3.48e-11 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 2.08000000e+02 Root relaxation: objective 2.080000e+02, 34 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 208.0000000 208.00000 0.0% - 0s Explored 0 nodes (34 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.080000000000e+02, best bound 2.080000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 208 Solution: 4 x [1, 2, 3, 5, 6, 8] 5 x [1, 3, 5] 4 x [1, 3, 5, 6, 8] 14 x [1, 3, 5, 8] 6 x [1, 3, 5, 10] 10 x [1, 3, 10] 62 x [2, 3, 4, 5] 54 x [2, 3, 4, 5, 6, 7, 8] 27 x [2, 3, 4, 5, 8, 9] 1 x [3] 9 x [3, 4] 12 x [3, 10]