Build (method = -2) #dp: 3034 Step-3' Graph: 261 vertices and 1006 arcs (0.01s) Step-4' Graph: 202 vertices and 888 arcs (0.02s) #V4/#V3 = 0.77 #A4/#A3 = 0.88 Ready! (0.02s) Optimize a model with 212 rows, 889 columns and 2274 nonzeros Presolve removed 36 rows and 71 columns Presolve time: 0.01s Presolved: 176 rows, 818 columns, 2181 nonzeros Variable types: 0 continuous, 818 integer (0 binary) Found heuristic solution: objective 887.0000000 Optimize a model with 176 rows, 818 columns and 2181 nonzeros Presolved: 176 rows, 818 columns, 2181 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.305e+03 Factor NZ : 4.626e+03 Factor Ops : 1.405e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.35063007e+03 -1.03353344e+05 9.04e+04 2.22e-16 4.12e+02 0s 1 2.05953254e+03 -5.47790580e+04 1.70e+04 5.55e-16 9.01e+01 0s 2 1.26231985e+03 -1.98877119e+04 4.19e+03 7.77e-16 2.38e+01 0s 3 9.98890541e+02 -4.05984583e+03 4.24e+02 1.22e-14 3.84e+00 0s 4 8.03876601e+02 -1.48500645e+03 3.43e-01 4.77e-15 1.39e+00 0s 5 5.26096055e+02 -8.98965371e+02 1.53e-01 2.89e-15 8.66e-01 0s 6 4.56681372e+02 -4.63981959e+02 1.19e-01 1.89e-15 5.59e-01 0s 7 3.35917260e+02 -3.51834134e+02 7.87e-02 1.11e-15 4.18e-01 0s 8 1.95737996e+02 -5.54272386e+01 3.48e-02 4.44e-16 1.53e-01 0s 9 1.53686544e+02 3.90243957e+01 1.54e-02 2.22e-16 6.97e-02 0s 10 1.34988680e+02 8.84762160e+01 6.81e-03 3.33e-16 2.83e-02 0s 11 1.34877129e+02 9.62487310e+01 6.14e-03 3.33e-16 2.35e-02 0s 12 1.30334847e+02 1.14493385e+02 2.80e-03 2.53e-16 9.63e-03 0s 13 1.25127344e+02 1.24038153e+02 9.29e-06 2.28e-16 6.62e-04 0s 14 1.25000040e+02 1.24999443e+02 9.75e-10 2.70e-16 3.63e-07 0s 15 1.25000000e+02 1.24999999e+02 1.28e-12 1.69e-16 3.63e-10 0s Barrier solved model in 15 iterations and 0.01 seconds Optimal objective 1.25000000e+02 Root relaxation: objective 1.250000e+02, 492 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 125.00000 0 44 887.00000 125.00000 85.9% - 0s H 0 0 127.0000000 125.00000 1.57% - 0s H 0 0 126.0000000 125.00000 0.79% - 0s 0 0 125.00000 0 11 126.00000 125.00000 0.79% - 0s 0 0 125.00000 0 20 126.00000 125.00000 0.79% - 0s H 0 0 125.0000000 125.00000 0.0% - 0s Explored 0 nodes (2479 simplex iterations) in 0.16 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.02 seconds Gurobi run time: 0.16 seconds Total run time: 0.19 seconds Objective: 125 Solution: 1 x [1, 2, 5, 6, 7, 7, 7, 7] 24 x [2, 3, 3, 5, 5, 6, 6, 6] 30 x [4, 4, 5, 5, 6, 7, 7, 10] 7 x [1, 1, 1, 1, 2, 6, 7, 8] 7 x [1, 1, 1, 1, 2, 4, 6, 7] 4 x [2, 2, 4, 4, 4, 4, 6, 10] 6 x [1, 1, 1, 2, 2, 6, 6, 7] 1 x [1, 1, 1, 2, 2, 7, 7, 7] 1 x [2, 2, 2, 3, 6, 7, 7, 9] 6 x [1, 2, 2, 2, 2, 7, 7, 7] 16 x [4, 4, 4, 4, 6, 9, 9, 10] 12 x [1, 4, 7, 9, 9, 9, 9, 9] 8 x [1, 7, 7, 9, 9, 9, 9, 9] 1 x [4, 6, 8, 8, 8, 8, 9, 9] 1 x [4, 4, 8, 8, 8, 8, 9, 9]