Build (method = -2) #dp: 13684 Step-3' Graph: 536 vertices and 2106 arcs (0.08s) Step-4' Graph: 491 vertices and 2016 arcs (0.08s) #V4/#V3 = 0.92 #A4/#A3 = 0.96 Ready! (0.08s) Optimize a model with 501 rows, 2017 columns and 5084 nonzeros Presolve removed 226 rows and 439 columns Presolve time: 0.02s Presolved: 275 rows, 1578 columns, 4424 nonzeros Variable types: 0 continuous, 1578 integer (0 binary) Found heuristic solution: objective 997.0000000 Found heuristic solution: objective 817.0000000 Optimize a model with 275 rows, 1578 columns and 4424 nonzeros Presolved: 275 rows, 1578 columns, 4424 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.443e+03 Factor NZ : 9.512e+03 Factor Ops : 4.736e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.85367971e+03 -1.68383225e+05 1.18e+05 2.22e-16 3.03e+02 0s 1 1.55774525e+03 -9.37898994e+04 1.97e+04 1.22e-15 6.76e+01 0s 2 1.18651037e+03 -2.89103265e+04 5.19e+03 1.22e-15 1.78e+01 0s 3 1.00902896e+03 -1.01327974e+04 5.38e+02 1.09e-14 4.23e+00 0s 4 9.15786650e+02 -3.82264299e+03 7.51e+01 2.89e-15 1.56e+00 0s 5 7.97376783e+02 -1.81821042e+03 5.60e+01 9.99e-16 8.64e-01 0s 6 7.66537342e+02 -1.51787115e+03 4.74e+01 7.77e-16 7.51e-01 0s 7 5.51440388e+02 -1.07525778e+03 3.19e+01 6.66e-16 5.32e-01 0s 8 4.27945011e+02 -5.85306646e+02 2.32e+01 5.55e-16 3.32e-01 0s 9 3.59759075e+02 -4.29646558e+02 1.89e+01 4.13e-16 2.59e-01 0s 10 1.77273830e+02 -1.43027080e+02 8.06e+00 4.22e-16 1.05e-01 0s 11 1.30302217e+02 -6.52631974e+01 4.47e+00 3.93e-16 6.37e-02 0s 12 1.27374410e+02 8.45907100e+00 3.20e+00 3.54e-16 3.87e-02 0s 13 1.16800540e+02 3.99771354e+01 2.34e+00 3.43e-16 2.49e-02 0s 14 9.60734559e+01 5.35962550e+01 7.49e-01 2.92e-16 1.36e-02 0s 15 8.93232026e+01 7.00817164e+01 3.08e-01 2.78e-16 6.14e-03 0s 16 9.06308685e+01 7.65399104e+01 1.52e-01 3.96e-16 4.47e-03 0s 17 8.68839481e+01 8.01000523e+01 6.53e-02 3.19e-16 2.15e-03 0s 18 8.51668889e+01 8.24637269e+01 2.85e-02 2.75e-16 8.56e-04 0s 19 8.40445167e+01 8.31772611e+01 6.15e-03 3.19e-16 2.74e-04 0s 20 8.37858315e+01 8.34908568e+01 6.08e-04 3.33e-16 9.32e-05 0s 21 8.37579820e+01 8.36900734e+01 2.33e-04 2.49e-16 2.15e-05 0s 22 8.37398785e+01 8.37251433e+01 2.52e-05 4.44e-16 4.66e-06 0s 23 8.37370241e+01 8.37369452e+01 1.53e-11 2.71e-16 2.49e-08 0s 24 8.37370000e+01 8.37369999e+01 1.34e-11 2.30e-16 2.49e-11 0s Barrier solved model in 24 iterations and 0.04 seconds Optimal objective 8.37370000e+01 Root relaxation: objective 8.373700e+01, 405 iterations, 0.04 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 83.73700 0 47 817.00000 83.73700 89.8% - 0s H 0 0 85.0000000 83.73700 1.49% - 0s H 0 0 84.0000000 83.73700 0.31% - 0s Explored 0 nodes (981 simplex iterations) in 0.17 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 8.400000000000e+01, best bound 8.400000000000e+01, gap 0.0% Preprocessing time: 0.09 seconds Gurobi run time: 0.17 seconds Total run time: 0.26 seconds Objective: 84 Solution: 23 x [1, 2, 2, 5, 5, 6, 6, 7, 7, 7, 10, 10] 7 x [1, 3, 4, 4, 6, 8, 8, 9, 9, 9, 10, 10] 20 x [1, 1, 2, 2, 2, 5, 6, 9, 9, 9, 9, 9] 7 x [1, 1, 1, 3, 3, 5, 6, 9, 9, 9, 9, 9] 1 x [1, 1, 1, 3, 3, 5, 5, 7, 9, 9, 9] 1 x [2, 3, 3, 3, 3, 5, 7, 8, 8, 10] 4 x [2, 2, 2, 5, 5, 6, 6, 6, 6, 8, 10, 10] 1 x [3, 3, 4, 6, 6, 6, 6, 9, 10, 10] 1 x [2, 2, 2, 6, 6, 6, 10, 10, 10] 19 x [2, 3, 3, 3, 3, 5, 5, 5, 5, 7, 8, 8]