Build (method = -2) #dp: 14700 Step-3' Graph: 404 vertices and 2646 arcs (0.08s) Step-4' Graph: 340 vertices and 2518 arcs (0.08s) #V4/#V3 = 0.84 #A4/#A3 = 0.95 Ready! (0.08s) Optimize a model with 359 rows, 2519 columns and 6887 nonzeros Presolve removed 38 rows and 69 columns Presolve time: 0.02s Presolved: 321 rows, 2450 columns, 6832 nonzeros Variable types: 0 continuous, 2450 integer (0 binary) Found heuristic solution: objective 1574.0000000 Found heuristic solution: objective 1440.0000000 Optimize a model with 321 rows, 2450 columns and 6832 nonzeros Presolved: 321 rows, 2450 columns, 6832 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.008e+03 Factor NZ : 1.424e+04 (roughly 1 MByte of memory) Factor Ops : 8.069e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.94533499e+04 -7.18626563e+05 5.02e+05 2.22e-16 1.19e+03 0s 1 7.85596724e+03 -3.09994720e+05 8.00e+04 1.22e-15 2.15e+02 0s 2 4.15006728e+03 -1.15181119e+05 2.41e+04 7.99e-15 6.44e+01 0s 3 2.31598528e+03 -3.77550136e+04 3.50e+03 1.69e-14 1.30e+01 0s 4 2.01281553e+03 -1.17994650e+04 3.51e+02 6.44e-15 3.15e+00 0s 5 1.94988913e+03 -5.03429216e+03 3.61e+01 2.66e-15 1.44e+00 0s 6 1.62473256e+03 -5.03450101e+03 2.38e+01 2.22e-15 1.37e+00 0s 7 1.26591192e+03 -3.18258504e+03 1.39e+01 1.20e-15 9.11e-01 0s 8 7.45131387e+02 -1.72527405e+03 6.84e+00 1.36e-15 5.05e-01 0s 9 4.81769461e+02 -6.48161248e+02 3.15e+00 8.93e-16 2.31e-01 0s 10 3.80277117e+02 -2.60177918e+02 1.67e+00 8.93e-16 1.31e-01 0s 11 3.44019713e+02 -3.77558875e+01 1.14e+00 9.85e-16 7.79e-02 0s 12 3.14458038e+02 9.31114760e+01 5.68e-01 8.73e-16 4.51e-02 0s 13 3.04007915e+02 1.95157356e+02 3.32e-01 8.88e-16 2.22e-02 0s 14 2.93099738e+02 2.68895173e+02 7.72e-02 8.88e-16 4.93e-03 0s 15 2.85931411e+02 2.84118004e+02 1.01e-03 9.12e-16 3.69e-04 0s 16 2.85714516e+02 2.85712650e+02 8.29e-13 1.08e-15 3.79e-07 0s 17 2.85714286e+02 2.85714284e+02 3.86e-12 7.13e-16 3.79e-10 0s Barrier solved model in 17 iterations and 0.04 seconds Optimal objective 2.85714286e+02 Root relaxation: objective 2.857143e+02, 1856 iterations, 0.06 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 285.71429 0 36 1440.00000 285.71429 80.2% - 0s H 0 0 286.0000000 285.71429 0.10% - 0s Explored 0 nodes (3067 simplex iterations) in 0.21 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.860000000000e+02, best bound 2.860000000000e+02, gap 0.0% Preprocessing time: 0.10 seconds Gurobi run time: 0.21 seconds Total run time: 0.31 seconds Objective: 286 Solution: 21 x [1, 3, 11, 11, 15, 15, 18] 47 x [9, 9, 11, 11, 13, 14, 18] 5 x [9, 11, 11, 11, 14, 16, 18] 25 x [3, 4, 8, 11, 16, 17, 19] 11 x [3, 4, 5, 10, 11, 17, 19] 2 x [3, 3, 4, 11, 16, 17, 19] 6 x [4, 9, 11, 11, 14, 16, 19] 14 x [2, 4, 16, 16, 19, 19, 19] 3 x [9, 11, 11, 11, 12, 12, 16] 40 x [4, 6, 7, 9, 11, 13, 15] 15 x [4, 7, 9, 11, 13, 14, 14] 3 x [4, 9, 9, 11, 13, 14, 14] 1 x [4, 5, 11, 13, 14, 14] 11 x [4, 5, 9, 11, 14, 14, 15] 73 x [3, 5, 8, 10, 11, 15, 17] 1 x [8, 8, 8, 8, 8, 8] 8 x [8, 8, 8, 8, 8, 8, 15]