Build (method = -2) #dp: 13558 Step-3' Graph: 1236 vertices and 5011 arcs (0.08s) Step-4' Graph: 1179 vertices and 4897 arcs (0.09s) #V4/#V3 = 0.95 #A4/#A3 = 0.98 Ready! (0.09s) Optimize a model with 1189 rows, 4898 columns and 12352 nonzeros Presolve removed 377 rows and 716 columns Presolve time: 0.08s Presolved: 812 rows, 4182 columns, 11350 nonzeros Variable types: 0 continuous, 4182 integer (0 binary) Found heuristic solution: objective 100.0000000 Optimize a model with 812 rows, 4182 columns and 11350 nonzeros Presolved: 812 rows, 4182 columns, 11350 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 6.377e+03 Factor NZ : 3.235e+04 (roughly 2 MBytes of memory) Factor Ops : 1.824e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.13974724e+03 -8.64094047e+04 8.48e+04 1.11e-16 9.37e+01 0s 1 3.36347172e+02 -6.22091874e+04 1.41e+04 1.22e-15 2.03e+01 0s 2 1.89634106e+02 -2.52812613e+04 4.20e+03 1.33e-15 6.23e+00 0s 3 1.20202609e+02 -8.69497840e+03 9.38e+02 2.76e-14 1.70e+00 0s 4 1.05318871e+02 -3.68741766e+03 2.58e+02 2.66e-14 6.14e-01 0s 5 1.01495447e+02 -2.44644836e+03 8.35e+01 1.38e-14 3.51e-01 0s 6 9.97597569e+01 -5.57137460e+02 7.57e+00 1.31e-14 8.08e-02 0s 7 9.40135606e+01 -3.18286916e+02 1.80e-12 1.34e-14 4.92e-02 0s 8 6.56535777e+01 -2.67828966e+02 1.05e-12 1.21e-14 3.98e-02 0s 9 5.16260790e+01 -1.60218374e+02 7.43e-13 1.11e-14 2.53e-02 0s 10 3.53604705e+01 -7.32694041e+01 4.41e-13 1.01e-14 1.30e-02 0s 11 1.93289736e+01 -2.22200911e+01 2.01e-13 8.28e-15 4.96e-03 0s 12 1.65443415e+01 -1.62250465e+01 1.76e-13 1.14e-14 3.91e-03 0s 13 1.49000750e+01 -1.13777827e+01 1.71e-13 1.23e-14 3.14e-03 0s 14 1.25425807e+01 -4.31623403e+00 1.06e-13 1.20e-14 2.01e-03 0s 15 1.11288212e+01 5.01848962e-01 1.07e-13 9.79e-15 1.27e-03 0s 16 9.18616665e+00 2.86606604e+00 1.04e-13 1.09e-14 7.55e-04 0s 17 9.09542197e+00 5.64504919e+00 1.95e-13 1.00e-14 4.12e-04 0s 18 8.44478424e+00 6.69084729e+00 2.71e-12 9.44e-15 2.09e-04 0s 19 7.98839494e+00 7.35619010e+00 3.61e-12 8.72e-15 7.55e-05 0s 20 7.71926640e+00 7.57688125e+00 1.33e-11 8.53e-15 1.70e-05 0s 21 7.69268082e+00 7.68852313e+00 4.35e-11 6.86e-15 4.97e-07 0s 22 7.69230769e+00 7.69230768e+00 1.08e-11 7.01e-15 1.99e-12 0s Barrier solved model in 22 iterations and 0.10 seconds Optimal objective 7.69230769e+00 Root relaxation: objective 7.692308e+00, 2404 iterations, 0.13 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 7.69231 0 64 100.00000 7.69231 92.3% - 0s H 0 0 8.0000000 7.69231 3.85% - 0s Explored 0 nodes (4650 simplex iterations) in 0.52 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 8.000000000000e+00, best bound 8.000000000000e+00, gap 0.0% Preprocessing time: 0.11 seconds Gurobi run time: 0.52 seconds Total run time: 0.64 seconds Objective: 8 Solution: 2 x [1, 1, 1, 2, 3, 3, 3, 3, 8, 9, 9, 9, 10] 1 x [5, 5, 5, 5, 5, 6, 6, 7, 9, 9, 9, 10] 2 x [1, 1, 2, 2, 2, 2, 5, 5, 5, 7, 8, 8, 9] 1 x [1, 1, 1, 1, 7, 7, 9, 9, 9, 9, 9, 9, 9] 1 x [3, 3, 5, 5, 5, 5, 5, 7, 7, 7, 9] 1 x [1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 4, 9]