Build (method = -2) #dp: 8006 Step-3' Graph: 624 vertices and 2826 arcs (0.04s) Step-4' Graph: 616 vertices and 2810 arcs (0.05s) #V4/#V3 = 0.99 #A4/#A3 = 0.99 Ready! (0.05s) Optimize a model with 625 rows, 2811 columns and 7220 nonzeros Presolve removed 34 rows and 88 columns Presolve time: 0.04s Presolved: 591 rows, 2723 columns, 7062 nonzeros Variable types: 0 continuous, 2723 integer (0 binary) Found heuristic solution: objective 83.0000000 Found heuristic solution: objective 59.0000000 Optimize a model with 591 rows, 2723 columns and 7062 nonzeros Presolved: 591 rows, 2723 columns, 7062 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 4.259e+03 Factor NZ : 2.424e+04 (roughly 2 MBytes of memory) Factor Ops : 1.717e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.45621855e+02 -6.73816943e+04 4.14e+04 2.22e-16 8.58e+01 0s 1 1.59970363e+02 -5.33814706e+04 4.87e+03 4.44e-16 1.80e+01 0s 2 1.28848553e+02 -1.79108948e+04 1.83e+03 1.05e-15 5.58e+00 0s 3 1.54087180e+02 -5.48571356e+03 7.14e+02 1.07e-14 1.80e+00 0s 4 1.41550976e+02 -1.61422489e+03 2.08e+01 5.33e-15 3.39e-01 0s 5 1.40405390e+02 -7.51454996e+02 1.56e-01 1.78e-15 1.64e-01 0s 6 1.17494615e+02 -7.29124650e+02 1.24e-03 2.22e-15 1.55e-01 0s 7 8.21745338e+01 -3.32680711e+02 7.39e-04 8.88e-16 7.61e-02 0s 8 8.57901450e+01 -2.93669710e+02 7.30e-04 7.11e-16 6.96e-02 0s 9 8.63238085e+01 -1.92466703e+02 4.46e-04 1.98e-15 5.12e-02 0s 10 6.01134523e+01 -8.32140464e+01 2.36e-04 1.30e-15 2.63e-02 0s 11 5.20364667e+01 -4.96968936e+01 1.76e-04 1.25e-15 1.87e-02 0s 12 3.99498424e+01 -3.86986758e+01 1.34e-04 1.50e-15 1.44e-02 0s 13 3.28179582e+01 -2.34042895e+01 1.02e-04 1.56e-15 1.03e-02 0s 14 2.48444640e+01 -1.40869686e+01 6.90e-05 1.62e-15 7.14e-03 0s 15 1.41474000e+01 -6.80384957e+00 2.44e-05 1.31e-15 3.84e-03 0s 16 1.13616584e+01 -4.70134923e-01 1.44e-05 1.22e-15 2.17e-03 0s 17 1.10987855e+01 2.24222695e+00 1.16e-05 1.33e-15 1.62e-03 0s 18 9.42803729e+00 5.07697101e+00 4.57e-06 1.30e-15 7.98e-04 0s 19 8.93756378e+00 6.31895844e+00 2.52e-06 1.28e-15 4.80e-04 0s 20 8.71201733e+00 7.36878274e+00 1.62e-06 1.24e-15 2.46e-04 0s 21 8.45804669e+00 8.14055167e+00 1.50e-07 9.53e-16 5.82e-05 0s 22 8.41743037e+00 8.31672047e+00 4.38e-08 9.81e-16 1.85e-05 0s 23 8.41083944e+00 8.33122107e+00 3.13e-08 1.23e-15 1.46e-05 0s 24 8.39947786e+00 8.37119909e+00 9.35e-09 1.16e-15 5.18e-06 0s 25 8.39552194e+00 8.38380219e+00 3.10e-09 1.03e-15 2.15e-06 0s 26 8.39320634e+00 8.39255469e+00 2.27e-10 8.44e-16 1.19e-07 0s 27 8.39300021e+00 8.39299955e+00 7.17e-14 1.09e-15 1.20e-10 0s 28 8.39300000e+00 8.39300000e+00 4.36e-14 8.97e-16 1.20e-13 0s Barrier solved model in 28 iterations and 0.11 seconds Optimal objective 8.39300000e+00 Root relaxation: objective 8.393000e+00, 888 iterations, 0.13 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 8.39300 0 56 59.00000 8.39300 85.8% - 0s H 0 0 10.0000000 8.39300 16.1% - 0s H 0 0 9.0000000 8.39300 6.74% - 0s Explored 0 nodes (1936 simplex iterations) in 0.35 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 9.000000000000e+00, best bound 9.000000000000e+00, gap 0.0% Preprocessing time: 0.07 seconds Gurobi run time: 0.35 seconds Total run time: 0.42 seconds Objective: 9 Solution: 2 x [3, 3, 3, 7, 7, 8] 1 x [2, 2, 3, 3, 3, 4, 6] 1 x [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 7, 8, 9] 1 x [6, 7, 7, 7, 7, 8] 1 x [2, 2, 4, 7, 7, 7, 7] 1 x [2, 2, 8, 8, 8, 8, 9, 9] 2 x [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 4, 4, 4, 4, 5, 5, 6, 8, 8, 8, 8]