Build (method = -2) #dp: 31137 Step-3' Graph: 308 vertices and 4527 arcs (0.15s) Step-4' Graph: 245 vertices and 4401 arcs (0.15s) #V4/#V3 = 0.80 #A4/#A3 = 0.97 Ready! (0.15s) Optimize a model with 305 rows, 4402 columns and 12724 nonzeros Presolve removed 7 rows and 15 columns Presolve time: 0.04s Presolved: 298 rows, 4387 columns, 12697 nonzeros Variable types: 0 continuous, 4387 integer (0 binary) Found heuristic solution: objective 2724.0000000 Found heuristic solution: objective 2526.0000000 Optimize a model with 298 rows, 4387 columns and 12697 nonzeros Presolved: 298 rows, 4387 columns, 12697 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 7.916e+03 Factor NZ : 1.781e+04 (roughly 2 MBytes of memory) Factor Ops : 1.372e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.37219653e+05 -7.84832695e+05 6.90e+05 2.22e-16 1.26e+03 0s 1 3.81877877e+04 -2.42095732e+05 1.28e+05 3.11e-15 2.35e+02 0s 2 9.66338543e+03 -1.12656157e+05 2.25e+04 2.44e-15 4.77e+01 0s 3 3.36885697e+03 -4.02945945e+04 1.59e+03 5.33e-15 6.89e+00 0s 4 2.77520762e+03 -1.46317364e+04 2.27e+02 1.89e-15 2.17e+00 0s 5 2.27390105e+03 -9.05762956e+03 1.13e+02 1.33e-15 1.36e+00 0s 6 1.83560578e+03 -4.85084550e+03 7.61e+01 6.42e-16 8.05e-01 0s 7 1.07943638e+03 -2.62267811e+03 3.39e+01 6.90e-16 4.37e-01 0s 8 7.97332225e+02 -9.81791593e+02 1.75e+01 5.05e-16 2.08e-01 0s 9 6.72044555e+02 3.42819420e+02 6.18e+00 5.97e-16 3.86e-02 0s 10 6.38033100e+02 5.16432115e+02 2.49e+00 3.33e-16 1.40e-02 0s 11 6.20618442e+02 5.89961087e+02 1.20e+00 2.29e-16 3.53e-03 0s 12 6.10358115e+02 6.02668443e+02 4.71e-01 3.19e-16 8.85e-04 0s 13 6.03818514e+02 6.03645950e+02 8.74e-04 4.44e-16 1.96e-05 0s 14 6.03800019e+02 6.03799846e+02 3.28e-11 2.74e-16 1.96e-08 0s 15 6.03800000e+02 6.03800000e+02 4.83e-12 3.33e-16 2.09e-14 0s Barrier solved model in 15 iterations and 0.06 seconds Optimal objective 6.03800000e+02 Root relaxation: objective 6.038000e+02, 3858 iterations, 0.11 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 603.80000 0 34 2526.00000 603.80000 76.1% - 0s H 0 0 605.0000000 603.80000 0.20% - 0s H 0 0 604.0000000 603.80000 0.03% - 0s Explored 0 nodes (5457 simplex iterations) in 0.47 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 6.040000000000e+02, best bound 6.040000000000e+02, gap 0.0% Preprocessing time: 0.18 seconds Gurobi run time: 0.47 seconds Total run time: 0.65 seconds Objective: 604 Solution: 8 x [12, 22, 24, 40, 48] 20 x [1, 12, 24, 24, 28] 3 x [12, 16, 20, 24, 24] 31 x [7, 10, 12, 33, 34] 15 x [12, 21, 21, 22, 49] 13 x [22, 24, 36, 50, 60] 6 x [5, 19, 27, 38, 60] 8 x [17, 27, 38, 56, 60] 48 x [21, 23, 37, 44, 44] 13 x [1, 6, 11, 28, 42] 1 x [7, 13, 22, 32, 36] 1 x [8, 13, 25, 28, 32] 6 x [1, 22, 24, 49, 53] 14 x [7, 10, 33, 53, 56] 50 x [34, 49, 50, 53, 56] 27 x [28, 49, 52, 53, 57] 2 x [2, 40, 42, 56, 56] 7 x [10, 33, 42, 47, 50] 24 x [31, 36, 37, 42, 46] 10 x [23, 40, 45, 48, 59] 1 x [5, 10, 23, 33] 22 x [5, 7, 23, 46, 52] 2 x [1, 22, 24, 26, 58] 3 x [5, 15, 39, 41, 57] 1 x [28, 33, 39, 41, 57] 8 x [30, 32, 41, 45, 48] 12 x [1, 15, 19, 41, 55] 1 x [9, 20, 33, 41, 57] 3 x [8, 25, 28, 41, 46] 13 x [8, 21, 25, 41, 52] 24 x [25, 35, 39, 51, 54] 21 x [14, 43, 48, 54, 58] 31 x [3, 14, 54, 57, 58] 3 x [9, 11, 14, 52, 58] 21 x [18, 31, 35, 55, 58] 11 x [9, 20, 35, 51, 57] 4 x [1, 10, 33, 35, 50] 27 x [15, 22, 29, 36, 38] 2 x [35, 43, 45, 48, 55] 42 x [11, 15, 19, 29, 55] 9 x [15, 18, 29, 55, 55] 34 x [3, 4, 18, 35, 46] 2 x [9, 20, 35, 52, 52]