Build (method = -2) #dp: 198 Step-3' Graph: 32 vertices and 87 arcs (0.00s) Step-4' Graph: 5 vertices and 33 arcs (0.00s) #V4/#V3 = 0.16 #A4/#A3 = 0.38 Ready! (0.00s) Optimize a model with 15 rows, 34 columns and 98 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 13 rows, 32 columns, 94 nonzeros Variable types: 0 continuous, 32 integer (0 binary) Found heuristic solution: objective 99.0000000 Found heuristic solution: objective 91.0000000 Optimize a model with 13 rows, 32 columns and 94 nonzeros Presolved: 13 rows, 32 columns, 94 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.300e+01 Factor NZ : 9.100e+01 Factor Ops : 8.190e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.75920107e+02 -2.63331874e+02 1.81e+01 0.00e+00 1.15e+01 0s 1 6.12449788e+01 -6.67848526e+01 3.55e-15 4.44e-16 1.78e+00 0s 2 3.78337899e+01 2.34115539e+01 1.78e-15 1.11e-16 1.95e-01 0s 3 3.33522565e+01 3.32296085e+01 1.29e-14 2.22e-16 1.66e-03 0s 4 3.33333523e+01 3.33332296e+01 6.31e-15 1.67e-16 1.66e-06 0s 5 3.33333333e+01 3.33333333e+01 1.91e-14 1.11e-16 1.66e-12 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 3.33333333e+01 Root relaxation: objective 3.333333e+01, 26 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 33.33333 0 4 91.00000 33.33333 63.4% - 0s H 0 0 34.0000000 33.33333 1.96% - 0s Explored 0 nodes (31 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 3.400000000000e+01, best bound 3.400000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 34 Solution: 9 x [2, 8, 10] 1 x [10] 1 x [6, 7, 10] 9 x [1, 5, 6] 7 x [1, 4, 9] 3 x [7, 8, 9] 2 x [3, 7, 9] 1 x [4, 4, 9] 1 x [3, 3, 3]