Build (method = -2) #dp: 4223 Step-3' Graph: 238 vertices and 951 arcs (0.02s) Step-4' Graph: 176 vertices and 827 arcs (0.02s) #V4/#V3 = 0.74 #A4/#A3 = 0.87 Ready! (0.02s) Optimize a model with 186 rows, 828 columns and 2143 nonzeros Presolve removed 26 rows and 51 columns Presolve time: 0.01s Presolved: 160 rows, 777 columns, 2077 nonzeros Variable types: 0 continuous, 777 integer (0 binary) Found heuristic solution: objective 789.0000000 Optimize a model with 160 rows, 777 columns and 2077 nonzeros Presolved: 160 rows, 777 columns, 2077 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.205e+03 Factor NZ : 3.934e+03 Factor Ops : 1.167e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.51551333e+03 -1.05735381e+05 9.46e+04 2.22e-16 3.84e+02 0s 1 2.16766438e+03 -4.96830097e+04 1.86e+04 6.66e-16 8.36e+01 0s 2 1.29175959e+03 -1.81666464e+04 4.12e+03 5.55e-16 2.10e+01 0s 3 9.90567911e+02 -2.61094280e+03 2.24e+02 1.33e-15 2.61e+00 0s 4 7.94357463e+02 -1.14531235e+03 3.73e-01 8.88e-16 1.24e+00 0s 5 4.83145041e+02 -7.80879745e+02 1.52e-01 4.44e-16 8.08e-01 0s 6 2.52850125e+02 -3.09436576e+02 7.05e-02 4.44e-16 3.60e-01 0s 7 2.09365931e+02 -5.23900118e+01 5.54e-02 5.55e-16 1.67e-01 0s 8 1.54823022e+02 3.26008613e+01 2.83e-02 2.27e-16 7.82e-02 0s 9 1.47662660e+02 6.62539917e+01 2.02e-02 3.20e-16 5.21e-02 0s 10 1.35069241e+02 1.10425216e+02 4.88e-03 2.22e-16 1.58e-02 0s 11 1.26914272e+02 1.20947086e+02 1.03e-03 2.22e-16 3.82e-03 0s 12 1.25134013e+02 1.23558603e+02 4.23e-05 2.64e-16 1.01e-03 0s 13 1.25003306e+02 1.24990372e+02 1.14e-11 3.70e-16 8.27e-06 0s 14 1.25000000e+02 1.25000000e+02 1.38e-10 3.72e-16 3.48e-11 0s Barrier solved model in 14 iterations and 0.01 seconds Optimal objective 1.25000000e+02 Root relaxation: objective 1.250000e+02, 391 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 125.00000 0 37 789.00000 125.00000 84.2% - 0s H 0 0 126.0000000 125.00000 0.79% - 0s H 0 0 125.0000000 125.00000 0.0% - 0s Explored 0 nodes (773 simplex iterations) in 0.06 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.250000000000e+02, best bound 1.250000000000e+02, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.06 seconds Total run time: 0.09 seconds Objective: 125 Solution: 7 x [1, 3, 5, 5, 7, 8, 9, 9] 15 x [1, 2, 2, 2, 6, 7, 8, 10] 1 x [2, 2, 2, 5, 7, 8, 10, 10] 1 x [2, 2, 2, 5, 8, 10, 10, 10] 3 x [5, 5, 5, 5, 5, 5, 5, 8] 30 x [1, 3, 4, 5, 7, 8, 8, 8] 5 x [4, 5, 8, 8, 8, 10, 10, 10] 27 x [1, 3, 3, 7, 9, 9, 9, 9] 5 x [7, 9, 9, 9, 9, 10, 10, 10] 9 x [4, 4, 4, 4, 4, 6, 6, 6] 22 x [4, 5, 5, 6, 6, 6, 6, 7]