Build (method = -2) #dp: 167 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 827.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.17320107e+03 -2.64220003e+03 2.64e+02 1.11e-16 1.45e+02 0s 1 7.29682067e+02 -8.34275236e+02 1.61e+01 3.33e-16 2.42e+01 0s 2 3.92201664e+02 1.96652770e+02 2.47e-02 2.22e-16 2.65e+00 0s 3 3.34810220e+02 3.08895485e+02 1.44e-04 2.22e-16 3.50e-01 0s 4 3.33492884e+02 3.32525509e+02 2.20e-13 1.26e-16 1.31e-02 0s 5 3.33333502e+02 3.33333298e+02 9.42e-14 2.82e-16 2.76e-06 0s 6 3.33333333e+02 3.33333333e+02 1.37e-14 3.64e-16 2.88e-12 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 827.00000 333.33333 59.7% - 0s H 0 0 334.0000000 333.33333 0.20% - 0s Explored 0 nodes (37 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: 33 x [7, 8, 10] 126 x [2, 9, 10] 14 x [4, 8, 10] 81 x [1, 6, 8] 54 x [1, 3, 4] 1 x [3] 12 x [2, 3, 9] 1 x [2, 5, 9] 3 x [5, 8, 9] 9 x [8, 8, 9]