Build (method = -2) #dp: 5651 Step-3' Graph: 342 vertices and 1276 arcs (0.03s) Step-4' Graph: 266 vertices and 1124 arcs (0.03s) #V4/#V3 = 0.78 #A4/#A3 = 0.88 Ready! (0.03s) Optimize a model with 276 rows, 1125 columns and 2855 nonzeros Presolve removed 67 rows and 135 columns Presolve time: 0.01s Presolved: 209 rows, 990 columns, 2634 nonzeros Variable types: 0 continuous, 990 integer (0 binary) Found heuristic solution: objective 772.0000000 Found heuristic solution: objective 730.0000000 Optimize a model with 209 rows, 990 columns and 2634 nonzeros Presolved: 209 rows, 990 columns, 2634 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.540e+03 Factor NZ : 5.609e+03 Factor Ops : 1.877e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.55062947e+03 -1.23891174e+05 1.18e+05 2.22e-16 4.35e+02 0s 1 1.98076700e+03 -6.82289040e+04 1.72e+04 5.55e-16 8.24e+01 0s 2 1.26589878e+03 -2.15909611e+04 4.27e+03 2.44e-15 2.11e+01 0s 3 1.00671651e+03 -5.00017654e+03 2.90e+02 2.22e-15 3.49e+00 0s 4 8.39481588e+02 -2.29426493e+03 1.28e-12 1.33e-15 1.58e+00 0s 5 6.40447207e+02 -1.12850074e+03 7.96e-13 1.45e-15 8.89e-01 0s 6 3.99580689e+02 -6.86246717e+02 1.31e-12 1.51e-15 5.46e-01 0s 7 3.32201560e+02 -1.94701044e+02 1.07e-12 1.13e-15 2.65e-01 0s 8 1.99831024e+02 -3.83988603e+01 6.10e-13 1.39e-15 1.20e-01 0s 9 1.48697993e+02 5.39057142e+01 1.50e-12 1.04e-15 4.76e-02 0s 10 1.34886807e+02 8.70321397e+01 7.60e-13 9.36e-16 2.40e-02 0s 11 1.27351229e+02 1.00090680e+02 6.11e-13 1.37e-15 1.37e-02 0s 12 1.26809575e+02 1.04657665e+02 3.83e-13 1.36e-15 1.11e-02 0s 13 1.21485730e+02 1.13043184e+02 4.10e-13 1.09e-15 4.24e-03 0s 14 1.19575130e+02 1.15192652e+02 1.36e-12 1.22e-15 2.20e-03 0s 15 1.18337568e+02 1.16332757e+02 1.43e-12 1.19e-15 1.01e-03 0s 16 1.17883220e+02 1.17153236e+02 4.53e-13 1.09e-15 3.67e-04 0s 17 1.17717144e+02 1.17372843e+02 2.57e-12 1.15e-15 1.73e-04 0s 18 1.17633953e+02 1.17474941e+02 5.86e-12 1.19e-15 7.99e-05 0s 19 1.17588305e+02 1.17506338e+02 3.89e-12 1.25e-15 4.12e-05 0s 20 1.17562513e+02 1.17526524e+02 7.81e-12 1.09e-15 1.81e-05 0s 21 1.17554359e+02 1.17551702e+02 4.68e-12 1.14e-15 1.33e-06 0s 22 1.17553005e+02 1.17552780e+02 9.83e-11 1.03e-15 1.13e-07 0s 23 1.17552885e+02 1.17552884e+02 3.67e-10 1.39e-15 2.20e-10 0s Barrier solved model in 23 iterations and 0.02 seconds Optimal objective 1.17552885e+02 Root relaxation: objective 1.175529e+02, 143 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 117.55288 0 46 730.00000 117.55288 83.9% - 0s H 0 0 124.0000000 117.55288 5.20% - 0s H 0 0 118.0000000 117.55288 0.38% - 0s Explored 0 nodes (211 simplex iterations) in 0.06 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.180000000000e+02, best bound 1.180000000000e+02, gap 0.0% Preprocessing time: 0.04 seconds Gurobi run time: 0.06 seconds Total run time: 0.10 seconds Objective: 118 Solution: 5 x [2, 6, 6, 8, 8, 8, 10] 9 x [1, 2, 2, 6, 6, 6, 6, 10] 1 x [6, 6, 6, 6, 6, 7, 7, 10] 6 x [4, 4, 6, 6, 6, 7, 7, 7, 10] 6 x [2, 2, 4, 4, 4, 5, 9, 10, 10] 1 x [2, 2, 3, 5, 10, 10] 37 x [2, 2, 2, 3, 3, 4, 10, 10] 29 x [1, 4, 4, 6, 6, 6, 7, 10, 10] 2 x [2, 3, 4, 4, 4, 6, 10, 10, 10] 17 x [2, 2, 2, 2, 3, 3, 4, 4, 8] 1 x [6, 6, 6, 6, 7, 8, 8] 4 x [4, 6, 6, 6, 6, 7, 8, 8, 8]