Build (method = -2) #dp: 8323 Step-3' Graph: 619 vertices and 3254 arcs (0.04s) Step-4' Graph: 608 vertices and 3232 arcs (0.04s) #V4/#V3 = 0.98 #A4/#A3 = 0.99 Ready! (0.04s) Optimize a model with 618 rows, 3233 columns and 8562 nonzeros Presolve removed 43 rows and 80 columns Presolve time: 0.03s Presolved: 575 rows, 3153 columns, 8477 nonzeros Variable types: 0 continuous, 3153 integer (0 binary) Found heuristic solution: objective 706.0000000 Optimize a model with 575 rows, 3153 columns and 8477 nonzeros Presolved: 575 rows, 3153 columns, 8477 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.184e+03 Factor NZ : 3.658e+04 (roughly 2 MBytes of memory) Factor Ops : 4.481e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.91177499e+03 -5.60719544e+05 4.50e+05 2.22e-16 8.19e+02 0s 1 2.02354096e+03 -4.13105288e+05 5.88e+04 6.66e-16 1.54e+02 0s 2 1.55545424e+03 -1.06369447e+05 2.29e+04 1.11e-15 4.44e+01 0s 3 1.06961277e+03 -2.99656981e+04 3.84e+03 2.22e-15 8.80e+00 0s 4 9.87487084e+02 -6.34560637e+03 3.19e+02 3.11e-15 1.40e+00 0s 5 9.61952236e+02 -1.58831602e+03 8.64e-04 8.88e-16 4.04e-01 0s 6 8.93958715e+02 -1.07716162e+03 5.00e-04 5.55e-16 3.12e-01 0s 7 8.78221662e+02 -1.00203280e+03 4.74e-04 8.88e-16 2.98e-01 0s 8 7.01447322e+02 -7.85489740e+02 3.63e-04 4.53e-16 2.35e-01 0s 9 6.19270414e+02 -6.88282466e+02 3.15e-04 4.96e-16 2.07e-01 0s 10 3.93034716e+02 -4.36777333e+02 1.71e-04 3.69e-16 1.31e-01 0s 11 3.66342015e+02 -3.85372739e+02 1.55e-04 3.67e-16 1.19e-01 0s 12 3.24855033e+02 -2.55073094e+02 1.31e-04 3.07e-16 9.18e-02 0s 13 2.37224517e+02 -1.61306924e+02 7.83e-05 3.02e-16 6.31e-02 0s 14 1.96716933e+02 -8.55198105e+01 5.03e-05 2.54e-16 4.47e-02 0s 15 1.49677307e+02 -1.35659954e+01 2.03e-05 2.78e-16 2.58e-02 0s 16 1.39640255e+02 4.07306711e+01 1.47e-05 2.15e-16 1.57e-02 0s 17 1.34509500e+02 6.08361505e+01 1.07e-05 3.33e-16 1.17e-02 0s 18 1.31759083e+02 8.02193133e+01 8.65e-06 2.11e-16 8.16e-03 0s 19 1.24507594e+02 9.87798368e+01 3.23e-06 2.26e-16 4.07e-03 0s 20 1.23256255e+02 1.09149198e+02 2.57e-06 2.31e-16 2.23e-03 0s 21 1.20922931e+02 1.14057386e+02 1.14e-06 2.08e-16 1.09e-03 0s 22 1.20453056e+02 1.17229406e+02 8.12e-07 2.58e-16 5.10e-04 0s 23 1.19986557e+02 1.18105367e+02 5.05e-07 3.33e-16 2.98e-04 0s 24 1.19642462e+02 1.18471182e+02 2.74e-07 1.99e-16 1.85e-04 0s 25 1.19414855e+02 1.18770749e+02 1.35e-07 2.22e-16 1.02e-04 0s 26 1.19335272e+02 1.18924104e+02 9.10e-08 2.22e-16 6.51e-05 0s 27 1.19257707e+02 1.19027846e+02 4.86e-08 2.22e-16 3.64e-05 0s 28 1.19247496e+02 1.19047694e+02 4.30e-08 2.38e-16 3.16e-05 0s 29 1.19231179e+02 1.19058828e+02 3.51e-08 1.67e-16 2.73e-05 0s 30 1.19208030e+02 1.19093810e+02 2.30e-08 2.22e-16 1.81e-05 0s 31 1.19183816e+02 1.19137309e+02 1.04e-08 2.22e-16 7.36e-06 0s 32 1.19167702e+02 1.19158890e+02 1.75e-09 3.17e-16 1.40e-06 0s 33 1.19164016e+02 1.19163935e+02 3.77e-12 2.67e-16 1.27e-08 0s 34 1.19164000e+02 1.19164000e+02 5.65e-12 2.89e-16 2.72e-14 0s Barrier solved model in 34 iterations and 0.19 seconds Optimal objective 1.19164000e+02 Root relaxation: objective 1.191640e+02, 1141 iterations, 0.20 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 119.16400 0 47 706.00000 119.16400 83.1% - 0s H 0 0 120.0000000 119.16400 0.70% - 0s Explored 0 nodes (2977 simplex iterations) in 0.45 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.200000000000e+02, best bound 1.200000000000e+02, gap 0.0% Preprocessing time: 0.06 seconds Gurobi run time: 0.45 seconds Total run time: 0.51 seconds Objective: 120 Solution: 15 x [2, 2, 2, 2, 5, 7, 9] 1 x [3, 4, 4, 7, 9, 10, 10, 10, 10] 16 x [3, 4, 4, 4, 4, 4, 4, 7, 9, 10, 10, 10, 10] 30 x [2, 5, 5, 5, 6, 9, 9] 7 x [2, 5, 8, 9, 10, 10, 10, 10] 9 x [2, 3, 5, 5, 8, 9, 10, 10] 1 x [1, 2, 2, 5, 5, 8] 3 x [1, 2, 2, 2, 5, 5, 5, 8] 18 x [2, 2, 2, 8, 9, 9, 10, 10] 9 x [2, 2, 2, 3, 3, 10, 10, 10] 7 x [2, 2, 2, 3, 8, 8, 8, 8, 9] 1 x [1, 3, 9, 10, 10, 10] 1 x [1, 3, 3, 8, 9, 10, 10, 10, 10] 2 x [1, 3, 3, 9, 10, 10, 10, 10]