Build (method = -2) #dp: 182 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 831.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.07420107e+03 -2.64042076e+03 2.44e+02 0.00e+00 1.37e+02 0s 1 6.51017544e+02 -7.73724824e+02 4.48e+00 2.22e-16 2.05e+01 0s 2 4.26945822e+02 3.33861960e+00 4.89e-01 2.22e-16 5.79e+00 0s 3 3.36421562e+02 3.11742198e+02 8.53e-14 2.22e-16 3.34e-01 0s 4 3.33445470e+02 3.32929504e+02 1.14e-13 2.22e-16 6.97e-03 0s 5 3.33333341e+02 3.33333327e+02 1.47e-13 2.22e-16 2.01e-07 0s 6 3.33333333e+02 3.33333333e+02 2.79e-13 2.22e-16 2.11e-13 0s Barrier solved model in 6 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 4 831.00000 333.33333 59.9% - 0s H 0 0 334.0000000 333.33333 0.20% - 0s Explored 0 nodes (29 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: 72 x [5, 7, 10] 11 x [6, 9, 10] 74 x [1, 5, 10] 4 x [1, 2, 10] 2 x [1, 4, 10] 3 x [6, 10, 10] 1 x [3, 6] 1 x [3, 5] 104 x [1, 3, 4] 41 x [2, 8, 9] 21 x [1, 4, 5]