Build (method = -2) #dp: 166 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 999.0000000 Found heuristic solution: objective 909.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 2.00220107e+03 -2.63900841e+03 2.30e+02 1.11e-16 1.32e+02 0s 1 6.19856373e+02 -7.51723336e+02 1.42e-13 3.89e-16 1.91e+01 0s 2 3.85760049e+02 1.18850198e+02 1.14e-13 2.08e-16 3.63e+00 0s 3 3.33655163e+02 3.20953166e+02 2.49e-14 4.51e-17 1.72e-01 0s 4 3.33333677e+02 3.33320956e+02 7.51e-14 1.58e-16 1.72e-04 0s 5 3.33333333e+02 3.33333333e+02 6.31e-14 2.22e-16 1.72e-10 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 3.33333333e+02 Root relaxation: objective 3.333333e+02, 26 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 333.33333 0 3 909.00000 333.33333 63.3% - 0s H 0 0 334.0000000 333.33333 0.20% - 0s Explored 0 nodes (32 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 3.340000000000e+02, best bound 3.340000000000e+02, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 334 Solution: 80 x [3, 4, 9] 9 x [2, 3, 8] 2 x [2, 3, 6] 22 x [1, 6, 9] 1 x [1, 6] 37 x [2, 5, 6] 6 x [2, 7, 9] 107 x [7, 9, 10] 1 x [2, 7] 1 x [2, 4, 6] 68 x [6, 6, 8]