Build (method = -2) #dp: 16857 Step-3' Graph: 562 vertices and 2243 arcs (0.09s) Step-4' Graph: 499 vertices and 2117 arcs (0.10s) #V4/#V3 = 0.89 #A4/#A3 = 0.94 Ready! (0.10s) Optimize a model with 509 rows, 2118 columns and 5360 nonzeros Presolve removed 183 rows and 347 columns Presolve time: 0.03s Presolved: 326 rows, 1771 columns, 4855 nonzeros Variable types: 0 continuous, 1771 integer (0 binary) Found heuristic solution: objective 99.0000000 Optimize a model with 326 rows, 1771 columns and 4855 nonzeros Presolved: 326 rows, 1771 columns, 4855 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.725e+03 Factor NZ : 1.160e+04 Factor Ops : 5.994e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.40101689e+03 -4.99328879e+04 4.28e+04 2.22e-16 1.38e+02 0s 1 3.86857657e+02 -2.43542563e+04 7.42e+03 1.11e-15 2.62e+01 0s 2 1.68977084e+02 -1.01654780e+04 1.55e+03 1.11e-15 6.26e+00 0s 3 1.17393147e+02 -3.23012393e+03 3.72e+02 3.55e-15 1.60e+00 0s 4 1.00364755e+02 -9.28634892e+02 3.38e+01 1.15e-14 3.36e-01 0s 5 9.83187417e+01 -1.24594760e+02 6.30e-02 3.11e-15 6.28e-02 0s 6 6.67462056e+01 -1.45826146e+02 2.41e-02 2.89e-15 5.99e-02 0s 7 5.34330473e+01 -4.97693275e+01 1.48e-02 8.88e-16 2.91e-02 0s 8 2.98771411e+01 -2.47566357e+01 8.84e-03 5.55e-16 1.54e-02 0s 9 1.70607925e+01 -6.82599538e+00 4.58e-03 3.07e-16 6.73e-03 0s 10 1.40735218e+01 -2.99242014e+00 3.53e-03 3.09e-16 4.81e-03 0s 11 1.13697749e+01 1.16188473e+00 2.31e-03 2.07e-16 2.88e-03 0s 12 1.05113350e+01 4.35582417e+00 1.35e-03 2.63e-16 1.73e-03 0s 13 9.26644723e+00 6.52702135e+00 6.46e-04 1.79e-16 7.72e-04 0s 14 9.25094904e+00 7.38789452e+00 4.45e-04 2.39e-16 5.25e-04 0s 15 8.39896506e+00 8.05728218e+00 2.32e-05 2.20e-16 9.62e-05 0s 16 8.33467336e+00 8.32776188e+00 2.12e-07 3.33e-16 1.95e-06 0s 17 8.33333338e+00 8.33333327e+00 4.45e-12 3.49e-16 2.91e-11 0s 18 8.33333333e+00 8.33333333e+00 9.13e-13 2.27e-16 2.97e-17 0s Barrier solved model in 18 iterations and 0.03 seconds Optimal objective 8.33333333e+00 Root relaxation: objective 8.333333e+00, 896 iterations, 0.05 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 8.33333 0 54 99.00000 8.33333 91.6% - 0s H 0 0 9.0000000 8.33333 7.41% - 0s Explored 0 nodes (1679 simplex iterations) in 0.18 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.11 seconds Gurobi run time: 0.18 seconds Total run time: 0.29 seconds Objective: 9 Solution: 2 x [1, 2, 2, 2, 2, 3, 3, 5, 7, 7, 9, 9] 1 x [1, 3, 3, 4, 4, 4, 7, 7, 7, 7, 7, 10] 1 x [1, 1, 1, 2, 4, 9, 10, 10, 10, 10, 10] 2 x [1, 1, 1, 1, 2, 4, 4, 9, 10, 10, 10, 10] 1 x [2, 5, 6, 7, 7, 8, 9, 9] 1 x [2, 5, 6, 7, 7, 9, 9, 9, 9] 1 x [2, 2, 3, 4, 6, 7, 7, 7, 7, 7, 9, 9]