Build (method = -2) #dp: 23124 Step-3' Graph: 1216 vertices and 4980 arcs (0.14s) Step-4' Graph: 1155 vertices and 4858 arcs (0.15s) #V4/#V3 = 0.95 #A4/#A3 = 0.98 Ready! (0.15s) Optimize a model with 1164 rows, 4859 columns and 12285 nonzeros Presolve removed 461 rows and 893 columns Presolve time: 0.07s Presolved: 703 rows, 3966 columns, 10860 nonzeros Variable types: 0 continuous, 3966 integer (0 binary) Found heuristic solution: objective 1000.0000000 Optimize a model with 703 rows, 3966 columns and 10860 nonzeros Presolved: 703 rows, 3966 columns, 10860 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 5.902e+03 Factor NZ : 4.262e+04 (roughly 2 MBytes of memory) Factor Ops : 4.677e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 8.62140340e+03 -7.68595334e+05 6.18e+05 2.22e-16 7.98e+02 0s 1 2.45892548e+03 -5.53225031e+05 9.73e+04 4.44e-16 1.72e+02 0s 2 1.61251743e+03 -2.29695233e+05 3.10e+04 1.33e-15 5.60e+01 0s 3 1.19319364e+03 -8.40132148e+04 9.19e+03 2.22e-15 1.79e+01 0s 4 1.02168591e+03 -3.59421094e+04 1.02e+03 3.11e-15 5.39e+00 0s 5 9.98208034e+02 -8.21713566e+03 7.70e-03 9.77e-15 1.16e+00 0s 6 9.92377051e+02 -3.73819794e+03 9.47e-06 4.44e-15 5.96e-01 0s 7 7.73552540e+02 -3.02559729e+03 6.46e-06 3.89e-15 4.79e-01 0s 8 6.10617678e+02 -1.63376741e+03 3.59e-06 2.22e-15 2.83e-01 0s 9 3.80113759e+02 -7.60034125e+02 2.08e-06 7.77e-16 1.44e-01 0s 10 2.50997640e+02 -2.58024516e+02 1.30e-06 3.33e-16 6.41e-02 0s 11 1.30011241e+02 -1.31282373e+02 5.42e-07 3.12e-16 3.29e-02 0s 12 1.15661190e+02 -6.25803338e+01 4.35e-07 2.42e-16 2.24e-02 0s 13 9.11283713e+01 -1.17039063e+01 2.61e-07 2.79e-16 1.29e-02 0s 14 7.59399817e+01 2.51751965e+01 1.34e-07 2.94e-16 6.39e-03 0s 15 7.17589806e+01 4.91337518e+01 3.66e-08 2.38e-16 2.85e-03 0s 16 6.89521373e+01 5.92497481e+01 1.68e-08 1.91e-16 1.22e-03 0s 17 6.69782618e+01 6.44310109e+01 2.04e-09 2.44e-16 3.21e-04 0s 18 6.66733557e+01 6.66349079e+01 7.47e-11 3.86e-16 4.84e-06 0s 19 6.66666734e+01 6.66666349e+01 4.80e-11 3.09e-16 4.84e-09 0s 20 6.66666667e+01 6.66666666e+01 3.78e-11 3.33e-16 4.84e-12 0s Barrier solved model in 20 iterations and 0.12 seconds Optimal objective 6.66666667e+01 Root relaxation: objective 6.666667e+01, 2129 iterations, 0.16 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 66.66667 0 53 1000.00000 66.66667 93.3% - 0s H 0 0 68.0000000 66.66667 1.96% - 0s H 0 0 67.0000000 66.66667 0.50% - 0s Explored 0 nodes (5642 simplex iterations) in 0.81 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 6.700000000000e+01, best bound 6.700000000000e+01, gap 0.0% Preprocessing time: 0.17 seconds Gurobi run time: 0.81 seconds Total run time: 0.98 seconds Objective: 67 Solution: 7 x [2, 3, 3, 3, 4, 5, 6, 8, 8, 8, 8, 9, 9, 9, 9] 11 x [1, 2, 4, 4, 4, 4, 4, 4, 5, 5, 6, 8, 8, 8, 8] 1 x [3, 4, 4, 5, 5, 6, 8, 8, 8, 9, 9, 9, 9] 2 x [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 6, 9, 9, 9] 7 x [1, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 5, 6] 4 x [4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 8, 9, 9, 9, 9] 2 x [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 8] 12 x [1, 1, 1, 1, 4, 4, 6, 6, 6, 6, 6, 9, 9, 9, 9] 16 x [2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 7, 7, 7, 7, 8] 1 x [1, 2, 2, 2, 2, 2, 2, 2, 4, 4, 9, 9, 9, 9] 4 x [1, 2, 2, 2, 2, 2, 2, 2, 2, 4, 4, 9, 9, 9, 9]