Build (method = -2) #dp: 29208 Step-3' Graph: 858 vertices and 3710 arcs (0.18s) Step-4' Graph: 784 vertices and 3562 arcs (0.19s) #V4/#V3 = 0.91 #A4/#A3 = 0.96 Ready! (0.19s) Optimize a model with 794 rows, 3563 columns and 9137 nonzeros Presolve removed 208 rows and 390 columns Presolve time: 0.06s Presolved: 586 rows, 3173 columns, 8656 nonzeros Variable types: 0 continuous, 3173 integer (0 binary) Found heuristic solution: objective 1000.0000000 Optimize a model with 586 rows, 3173 columns and 8656 nonzeros Presolved: 586 rows, 3173 columns, 8656 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.977e+03 Factor NZ : 2.705e+04 (roughly 2 MBytes of memory) Factor Ops : 2.049e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 8.85758821e+03 -4.25586781e+05 4.75e+05 2.22e-16 5.23e+02 0s 1 2.73888917e+03 -2.60712613e+05 9.39e+04 6.88e-15 1.22e+02 0s 2 1.70305019e+03 -1.03201817e+05 2.94e+04 4.77e-15 3.78e+01 0s 3 1.23506268e+03 -3.41155624e+04 9.04e+03 3.44e-15 1.12e+01 0s 4 1.04615361e+03 -1.32965070e+04 1.97e+03 4.10e-15 3.33e+00 0s 5 9.96100481e+02 -4.33346817e+03 1.31e+02 2.30e-15 8.91e-01 0s 6 9.68299588e+02 -1.88660428e+03 2.27e-02 4.07e-15 4.49e-01 0s 7 6.82998891e+02 -1.83430262e+03 1.34e-02 5.47e-15 3.96e-01 0s 8 6.41256032e+02 -1.08276611e+03 1.19e-02 5.63e-15 2.71e-01 0s 9 6.28804384e+02 -8.97980470e+02 1.13e-02 6.31e-15 2.40e-01 0s 10 4.01377325e+02 -1.88860725e+02 7.05e-03 3.29e-15 9.29e-02 0s 11 2.72046032e+02 -1.70552848e+02 4.67e-03 5.46e-15 6.96e-02 0s 12 2.43371825e+02 -1.23456383e+02 4.08e-03 5.07e-15 5.77e-02 0s 13 1.92400509e+02 -8.27347413e+01 3.15e-03 6.69e-15 4.33e-02 0s 14 1.47069410e+02 -6.01321357e+01 2.25e-03 6.97e-15 3.26e-02 0s 15 1.25711850e+02 -4.82432527e+01 1.70e-03 5.57e-15 2.74e-02 0s 16 1.03531044e+02 -7.12076145e+00 1.06e-03 4.96e-15 1.74e-02 0s 17 9.97928554e+01 4.21895335e+01 5.94e-04 3.78e-15 9.06e-03 0s 18 9.11015060e+01 5.75719342e+01 3.19e-04 4.13e-15 5.28e-03 0s 19 8.64788831e+01 6.84988260e+01 1.88e-04 4.01e-15 2.83e-03 0s 20 8.46010239e+01 7.02711239e+01 1.17e-04 5.62e-15 2.25e-03 0s 21 8.31965282e+01 7.62817951e+01 6.89e-05 4.69e-15 1.09e-03 0s 22 8.13545648e+01 7.88651180e+01 1.80e-05 4.55e-15 3.92e-04 0s 23 8.07929459e+01 7.98713916e+01 6.03e-06 4.16e-15 1.45e-04 0s 24 8.05543893e+01 8.02073116e+01 1.52e-06 4.49e-15 5.46e-05 0s 25 8.05034664e+01 8.03316826e+01 7.35e-07 4.06e-15 2.70e-05 0s 26 8.04718600e+01 8.04119600e+01 2.69e-07 4.17e-15 9.42e-06 0s 27 8.04539707e+01 8.04474940e+01 2.15e-08 3.66e-15 1.02e-06 0s 28 8.04520020e+01 8.04519954e+01 6.45e-12 3.55e-15 1.04e-09 0s 29 8.04520000e+01 8.04520000e+01 1.66e-11 3.55e-15 1.04e-12 0s Barrier solved model in 29 iterations and 0.11 seconds Optimal objective 8.04520000e+01 Root relaxation: objective 8.045200e+01, 970 iterations, 0.13 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 80.45200 0 47 1000.00000 80.45200 92.0% - 0s H 0 0 82.0000000 80.45200 1.89% - 0s H 0 0 81.0000000 80.45200 0.68% - 0s Explored 0 nodes (2717 simplex iterations) in 0.46 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 8.100000000000e+01, best bound 8.100000000000e+01, gap 0.0% Preprocessing time: 0.21 seconds Gurobi run time: 0.46 seconds Total run time: 0.67 seconds Objective: 81 Solution: 1 x [1, 2, 2, 3, 5, 5, 5, 6, 8, 9, 10, 10] 15 x [1, 1, 3, 4, 5, 6, 7, 9, 9, 9, 9, 10, 10] 2 x [1, 1, 3, 3, 5, 5, 5, 7, 9, 10] 29 x [1, 1, 2, 2, 2, 2, 2, 3, 4, 7, 9, 10, 10] 1 x [1, 1, 2, 3, 5, 5, 6, 6, 9, 9, 9] 4 x [1, 1, 1, 3, 3, 4, 7, 8, 9, 9, 9, 10, 10] 9 x [1, 1, 1, 3, 4, 4, 4, 4, 7, 9, 9, 9] 1 x [1, 1, 1, 3, 3, 7, 8, 9, 9, 9, 10, 10] 1 x [3, 3, 7, 7, 7, 7, 8, 9, 9, 10, 10] 11 x [5, 6, 7, 7, 7, 7, 7, 7, 8, 10, 10, 10] 7 x [4, 7, 7, 7, 7, 7, 7, 7, 9, 9]