Build (method = -2) #dp: 183 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 968.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.13720107e+03 -2.64157335e+03 2.57e+02 0.00e+00 1.42e+02 0s 1 6.95335042e+02 -7.70087359e+02 1.19e+01 3.33e-16 2.23e+01 0s 2 3.85707786e+02 1.93418642e+02 1.81e-02 4.44e-16 2.61e+00 0s 3 3.35585362e+02 3.26316641e+02 5.26e-04 2.22e-16 1.25e-01 0s 4 3.33336483e+02 3.33323682e+02 5.08e-14 1.41e-16 1.73e-04 0s 5 3.33333333e+02 3.33333333e+02 1.98e-14 3.33e-16 1.78e-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 4 968.00000 333.33333 65.6% - 0s H 0 0 334.0000000 333.33333 0.20% - 0s Explored 0 nodes (33 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: 30 x [2, 6, 7] 2 x [2, 3, 7] 101 x [2, 5, 9] 40 x [5, 8, 10] 1 x [2] 78 x [2, 4, 10] 7 x [1, 2, 8] 54 x [3, 9, 10] 1 x [3, 8, 10] 19 x [4, 8, 10] 1 x [1, 3, 4]