Build (method = -2) #dp: 4010 Step-3' Graph: 273 vertices and 1127 arcs (0.02s) Step-4' Graph: 199 vertices and 979 arcs (0.02s) #V4/#V3 = 0.73 #A4/#A3 = 0.87 Ready! (0.02s) Optimize a model with 209 rows, 980 columns and 2553 nonzeros Presolve removed 38 rows and 66 columns Presolve time: 0.01s Presolved: 171 rows, 914 columns, 2495 nonzeros Variable types: 0 continuous, 914 integer (0 binary) Found heuristic solution: objective 997.0000000 Optimize a model with 171 rows, 914 columns and 2495 nonzeros Presolved: 171 rows, 914 columns, 2495 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.410e+03 Factor NZ : 4.560e+03 Factor Ops : 1.439e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.13277343e+03 -1.56494346e+05 1.11e+05 1.11e-16 5.09e+02 0s 1 2.30851437e+03 -7.67209030e+04 2.02e+04 1.33e-15 1.08e+02 0s 2 1.39393273e+03 -2.82653058e+04 5.46e+03 4.44e-15 3.04e+01 0s 3 1.03947105e+03 -7.38991122e+03 7.08e+02 7.49e-16 5.99e+00 0s 4 9.22658748e+02 -2.45169678e+03 2.16e+01 1.11e-15 1.86e+00 0s 5 7.24219653e+02 -1.54455446e+03 1.38e+01 7.77e-16 1.25e+00 0s 6 4.60514865e+02 -1.09852403e+03 7.59e+00 1.11e-15 8.55e-01 0s 7 3.67054150e+02 -5.73524670e+02 5.52e+00 6.63e-16 5.16e-01 0s 8 2.80089615e+02 -3.51776909e+02 3.75e+00 7.53e-16 3.47e-01 0s 9 1.84518614e+02 -1.40666151e+02 1.92e+00 7.19e-16 1.78e-01 0s 10 1.64369179e+02 -4.41168796e+01 1.46e+00 7.62e-16 1.14e-01 0s 11 1.48902247e+02 7.06880391e+01 6.55e-01 5.31e-16 4.28e-02 0s 12 1.38791013e+02 1.00929866e+02 3.41e-01 5.13e-16 2.07e-02 0s 13 1.27658426e+02 1.20234842e+02 5.28e-02 5.11e-16 4.05e-03 0s 14 1.25196659e+02 1.24523769e+02 4.11e-03 4.18e-16 3.67e-04 0s 15 1.25000144e+02 1.24999792e+02 2.80e-06 5.77e-16 1.92e-07 0s 16 1.25000000e+02 1.25000000e+02 1.44e-12 4.44e-16 1.92e-10 0s Barrier solved model in 16 iterations and 0.01 seconds Optimal objective 1.25000000e+02 Root relaxation: objective 1.250000e+02, 453 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 125.0000000 125.00000 0.0% - 0s Explored 0 nodes (1033 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: 77 x [1, 2, 3, 3, 5, 7, 7, 8] 1 x [1, 2, 2, 3, 3, 5, 7, 7] 14 x [1, 1, 4, 4, 4, 8, 9, 10] 2 x [1, 1, 2, 2, 3, 3, 7, 7] 7 x [1, 1, 1, 2, 2, 2, 7, 8] 3 x [1, 1, 1, 2, 2, 2, 2, 2] 4 x [5, 6, 7, 8, 9, 9, 9, 10] 1 x [2, 2, 5, 6, 7, 9, 9, 9] 13 x [5, 6, 8, 9, 9, 9, 9, 10] 3 x [2, 2, 2, 2, 5, 6, 6, 6]