Build (method = -2) #dp: 116 Step-3' Graph: 26 vertices and 69 arcs (0.00s) Step-4' Graph: 5 vertices and 27 arcs (0.00s) #V4/#V3 = 0.19 #A4/#A3 = 0.39 Ready! (0.00s) Optimize a model with 13 rows, 28 columns and 80 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 11 rows, 26 columns, 76 nonzeros Variable types: 0 continuous, 26 integer (0 binary) Found heuristic solution: objective 999.0000000 Found heuristic solution: objective 698.0000000 Optimize a model with 11 rows, 26 columns and 76 nonzeros Presolved: 11 rows, 26 columns, 76 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.700e+01 Factor NZ : 6.600e+01 Factor Ops : 5.060e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.96305185e+03 -2.58435998e+03 2.80e+02 1.11e-16 1.59e+02 0s 1 6.14872057e+02 -7.00508156e+02 1.42e-13 3.33e-16 2.26e+01 0s 2 3.81023037e+02 1.39360809e+02 8.53e-14 2.22e-16 4.05e+00 0s 3 3.33680678e+02 3.22729211e+02 3.20e-14 1.11e-16 1.83e-01 0s 4 3.33333773e+02 3.33322732e+02 9.17e-14 2.22e-16 1.84e-04 0s 5 3.33333333e+02 3.33333333e+02 2.05e-13 1.11e-16 1.84e-10 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 3.33333333e+02 Root relaxation: objective 3.333333e+02, 20 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 698.00000 333.33333 52.2% - 0s H 0 0 334.0000000 333.33333 0.20% - 0s Explored 0 nodes (30 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: 14 x [4, 7, 8] 6 x [1, 7, 8] 64 x [7, 8, 8] 98 x [4, 6, 7] 118 x [1, 3, 7] 1 x [2, 7, 7] 2 x [1, 2, 8] 29 x [2, 5, 8] 1 x [2, 3, 4] 1 x [1]