Build (method = -2) #dp: 21696 Step-3' Graph: 1241 vertices and 5042 arcs (0.14s) Step-4' Graph: 1181 vertices and 4925 arcs (0.15s) #V4/#V3 = 0.95 #A4/#A3 = 0.98 Ready! (0.15s) Optimize a model with 1190 rows, 4926 columns and 12428 nonzeros Presolve removed 477 rows and 931 columns Presolve time: 0.08s Presolved: 713 rows, 3995 columns, 10906 nonzeros Variable types: 0 continuous, 3995 integer (0 binary) Found heuristic solution: objective 88.0000000 Optimize a model with 713 rows, 3995 columns and 10906 nonzeros Presolved: 713 rows, 3995 columns, 10906 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 5.935e+03 Factor NZ : 4.228e+04 (roughly 2 MBytes of memory) Factor Ops : 4.681e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.94131534e+02 -9.67081740e+04 7.05e+04 2.22e-16 1.02e+02 0s 1 3.14600162e+02 -6.69318449e+04 1.11e+04 8.88e-16 2.16e+01 0s 2 2.23523863e+02 -2.66833015e+04 3.50e+03 2.58e-14 6.81e+00 0s 3 1.87830392e+02 -8.00821984e+03 9.92e+02 1.76e-13 1.84e+00 0s 4 1.76404367e+02 -2.92181774e+03 1.08e+02 6.62e-14 4.61e-01 0s 5 1.73881193e+02 -6.77640037e+02 1.13e-01 8.38e-15 1.07e-01 0s 6 1.55319807e+02 -4.57650879e+02 1.26e-04 1.04e-14 7.66e-02 0s 7 1.14324260e+02 -2.55877530e+02 7.25e-05 1.09e-14 4.63e-02 0s 8 8.88122847e+01 -1.46947730e+02 4.95e-05 1.14e-14 2.95e-02 0s 9 8.45093319e+01 -1.22012370e+02 4.58e-05 1.39e-14 2.58e-02 0s 10 7.87691113e+01 -9.78453761e+01 4.07e-05 1.79e-14 2.21e-02 0s 11 7.46334399e+01 -9.21956873e+01 3.79e-05 1.87e-14 2.09e-02 0s 12 5.11743251e+01 -5.67221358e+01 2.49e-05 1.59e-14 1.35e-02 0s 13 3.93408705e+01 -1.63235725e+01 1.85e-05 8.58e-15 6.96e-03 0s 14 3.73908216e+01 -1.57662655e+01 1.75e-05 1.28e-14 6.65e-03 0s 15 3.21494522e+01 -1.30252087e+01 1.50e-05 1.40e-14 5.65e-03 0s 16 3.01143291e+01 -8.60378004e+00 1.40e-05 1.34e-14 4.84e-03 0s 17 1.63553091e+01 -4.14798276e+00 6.97e-06 1.21e-14 2.56e-03 0s 18 1.18634577e+01 -1.84576813e+00 4.03e-06 1.36e-14 1.71e-03 0s 19 1.07301780e+01 7.12839569e-01 3.19e-06 1.19e-14 1.25e-03 0s 20 8.38270492e+00 2.38494642e+00 1.78e-06 1.25e-14 7.50e-04 0s 21 7.71892250e+00 3.60175903e+00 1.26e-06 1.13e-14 5.15e-04 0s 22 7.51381101e+00 4.47506653e+00 1.09e-06 1.20e-14 3.80e-04 0s 23 7.44275802e+00 5.97232892e+00 9.94e-07 9.43e-15 1.84e-04 0s 24 7.17865993e+00 6.32711691e+00 6.55e-07 1.01e-14 1.06e-04 0s 25 6.74461368e+00 6.51602561e+00 9.71e-08 9.28e-15 2.86e-05 0s 26 6.66789591e+00 6.63906124e+00 1.40e-09 8.83e-15 3.60e-06 0s 27 6.66666963e+00 6.66666211e+00 4.06e-11 7.03e-15 9.40e-10 0s 28 6.66666667e+00 6.66666667e+00 1.27e-11 1.14e-14 9.56e-16 0s Barrier solved model in 28 iterations and 0.17 seconds Optimal objective 6.66666667e+00 Root relaxation: objective 6.666667e+00, 2152 iterations, 0.21 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 6.66667 0 42 88.00000 6.66667 92.4% - 0s H 0 0 8.0000000 6.66667 16.7% - 0s H 0 0 7.0000000 6.66667 4.76% - 0s Explored 0 nodes (4494 simplex iterations) in 0.68 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 7.000000000000e+00, best bound 7.000000000000e+00, gap 0.0% Preprocessing time: 0.17 seconds Gurobi run time: 0.68 seconds Total run time: 0.85 seconds Objective: 7 Solution: 1 x [1, 1, 1, 3, 3, 3, 3, 3, 4, 4, 4, 4, 6, 6, 6] 2 x [2, 4, 4, 4, 6, 6, 6, 6, 7, 9, 9, 9, 9, 9, 9] 1 x [1, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 5, 7, 7, 7] 2 x [1, 2, 2, 3, 4, 4, 4, 4, 5, 5, 8, 8, 8, 8, 8] 1 x [1, 2, 2, 3, 4, 4, 4, 5, 5, 7]