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 868.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.04720107e+03 -2.63990358e+03 2.39e+02 0.00e+00 1.36e+02 0s 1 6.31962753e+02 -7.70624671e+02 1.30e+00 4.44e-16 1.97e+01 0s 2 4.24728881e+02 -3.99341425e+01 1.44e-01 2.22e-16 6.35e+00 0s 3 3.38617388e+02 3.10087307e+02 4.62e-14 8.33e-17 3.86e-01 0s 4 3.33474260e+02 3.32813014e+02 7.48e-14 3.33e-16 8.94e-03 0s 5 3.33333336e+02 3.33333312e+02 1.28e-13 1.36e-16 3.12e-07 0s 6 3.33333333e+02 3.33333333e+02 7.91e-14 3.33e-16 3.12e-10 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 868.00000 333.33333 61.6% - 0s H 0 0 334.0000000 333.33333 0.20% - 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.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: 132 x [1, 2, 8] 13 x [7, 8, 9] 18 x [5, 7, 8] 1 x [4, 8, 8] 1 x [1, 8, 8] 71 x [4, 6, 7] 7 x [1, 7, 9] 33 x [1, 9, 10] 2 x [1, 6, 7] 54 x [3, 6, 7] 1 x [1, 6, 10] 1 x [1]