Build (method = -2) #dp: 14034 Step-3' Graph: 121 vertices and 363 arcs (0.07s) Step-4' Graph: 28 vertices and 177 arcs (0.07s) #V4/#V3 = 0.23 #A4/#A3 = 0.49 Ready! (0.07s) Optimize a model with 47 rows, 178 columns and 487 nonzeros Presolve removed 8 rows and 15 columns Presolve time: 0.00s Presolved: 39 rows, 163 columns, 458 nonzeros Variable types: 0 continuous, 163 integer (0 binary) Found heuristic solution: objective 1999.0000000 Found heuristic solution: objective 1390.0000000 Optimize a model with 39 rows, 163 columns and 458 nonzeros Presolved: 39 rows, 163 columns, 458 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.980e+02 Factor NZ : 4.540e+02 Factor Ops : 6.216e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.35995761e+04 -2.88841517e+04 9.70e+03 1.11e-16 5.64e+02 0s 1 3.27482123e+03 -1.38247743e+04 9.78e+02 7.77e-16 8.63e+01 0s 2 1.24706749e+03 -3.03354221e+03 9.17e-02 1.44e-15 1.25e+01 0s 3 6.19438008e+02 -2.80864180e+02 7.86e-03 2.22e-16 2.61e+00 0s 4 3.72263800e+02 1.92357932e+02 1.48e-03 1.93e-16 5.21e-01 0s 5 3.48573988e+02 3.08049391e+02 1.85e-04 1.89e-16 1.17e-01 0s 6 3.33901205e+02 3.32077403e+02 1.20e-05 2.22e-16 5.29e-03 0s 7 3.33333465e+02 3.33332490e+02 1.04e-10 3.33e-16 2.83e-06 0s 8 3.33333333e+02 3.33333332e+02 2.18e-13 3.33e-16 2.83e-09 0s Barrier solved model in 8 iterations and 0.00 seconds Optimal objective 3.33333333e+02 Root relaxation: objective 3.333333e+02, 126 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 8 1390.00000 333.33333 76.0% - 0s H 0 0 335.0000000 333.33333 0.50% - 0s 0 0 333.33333 0 12 335.00000 333.33333 0.50% - 0s H 0 0 334.0000000 333.33333 0.20% - 0s Cutting planes: Gomory: 1 Explored 0 nodes (174 simplex iterations) in 0.01 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.08 seconds Gurobi run time: 0.01 seconds Total run time: 0.09 seconds Objective: 334 Solution: 6 x [3, 4, 4, 6, 11, 19] 1 x [3, 6, 10, 11, 18, 19] 29 x [2, 6, 9, 10, 12, 19] 1 x [6, 14, 18, 19] 120 x [7, 10, 12, 13, 15, 19] 7 x [3, 6, 9, 11, 19, 19] 2 x [4, 4, 6, 10, 11, 16] 1 x [4, 4, 5, 16, 16] 15 x [1, 4, 4, 16, 16, 16] 2 x [4, 4, 10, 16, 16, 16] 21 x [3, 4, 4, 13, 14, 15] 1 x [3, 4, 4, 6, 9, 14] 3 x [6, 10, 11, 12, 15, 18] 72 x [6, 8, 10, 11, 11, 18] 52 x [5, 6, 8, 14, 17, 18] 1 x [5, 6, 6, 14, 18]