Build (method = -2) #dp: 4745 Step-3' Graph: 460 vertices and 1869 arcs (0.02s) Step-4' Graph: 365 vertices and 1679 arcs (0.03s) #V4/#V3 = 0.79 #A4/#A3 = 0.90 Ready! (0.03s) Optimize a model with 375 rows, 1680 columns and 4322 nonzeros Presolve removed 71 rows and 134 columns Presolve time: 0.02s Presolved: 304 rows, 1546 columns, 4167 nonzeros Variable types: 0 continuous, 1546 integer (0 binary) Found heuristic solution: objective 715.0000000 Optimize a model with 304 rows, 1546 columns and 4167 nonzeros Presolved: 304 rows, 1546 columns, 4167 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.373e+03 Factor NZ : 8.806e+03 Factor Ops : 3.108e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.20252087e+04 -3.67460060e+05 3.29e+05 2.22e-16 9.74e+02 0s 1 3.71362570e+03 -1.99175716e+05 5.48e+04 3.55e-15 1.87e+02 0s 2 1.93688070e+03 -8.52357243e+04 1.60e+04 7.55e-15 5.78e+01 0s 3 1.12107136e+03 -2.52270423e+04 2.09e+03 5.33e-15 1.18e+01 0s 4 1.02166360e+03 -8.47033751e+03 4.39e+02 5.11e-15 3.56e+00 0s 5 9.92362480e+02 -2.93138355e+03 2.51e-01 3.55e-15 1.27e+00 0s 6 6.31902414e+02 -2.20603815e+03 4.62e-05 3.23e-15 9.15e-01 0s 7 2.61831542e+02 -7.90950940e+02 1.46e-05 2.22e-15 3.39e-01 0s 8 1.88949459e+02 -2.37523799e+02 9.17e-06 2.06e-15 1.37e-01 0s 9 1.68094813e+02 2.05620342e+01 5.90e-06 1.94e-15 4.76e-02 0s 10 1.43114053e+02 7.25020165e+01 2.78e-06 2.19e-15 2.28e-02 0s 11 1.31538270e+02 9.68134931e+01 1.11e-06 2.19e-15 1.12e-02 0s 12 1.26020306e+02 1.03594084e+02 6.07e-07 2.50e-15 7.23e-03 0s 13 1.23857972e+02 1.11702919e+02 4.24e-07 2.49e-15 3.92e-03 0s 14 1.22114289e+02 1.14642077e+02 2.56e-07 2.45e-15 2.41e-03 0s 15 1.20294730e+02 1.16946210e+02 7.60e-08 2.26e-15 1.08e-03 0s 16 1.19551437e+02 1.18370415e+02 1.79e-08 1.94e-15 3.81e-04 0s 17 1.19344614e+02 1.18710141e+02 6.89e-09 2.56e-15 2.05e-04 0s 18 1.19281482e+02 1.18934132e+02 4.45e-09 2.53e-15 1.12e-04 0s 19 1.19238393e+02 1.19065405e+02 2.72e-09 2.35e-15 5.58e-05 0s 20 1.19199758e+02 1.19113456e+02 1.26e-09 2.43e-15 2.78e-05 0s 21 1.19176435e+02 1.19151193e+02 4.07e-10 1.82e-15 8.14e-06 0s 22 1.19166214e+02 1.19160365e+02 6.68e-11 1.93e-15 1.89e-06 0s 23 1.19164003e+02 1.19163992e+02 1.83e-12 1.70e-15 3.65e-09 0s 24 1.19164000e+02 1.19164000e+02 7.69e-13 1.73e-15 3.65e-12 0s Barrier solved model in 24 iterations and 0.03 seconds Optimal objective 1.19164000e+02 Root relaxation: objective 1.191640e+02, 238 iterations, 0.04 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 119.16400 0 48 715.00000 119.16400 83.3% - 0s H 0 0 120.0000000 119.16400 0.70% - 0s Explored 0 nodes (374 simplex iterations) in 0.10 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.200000000000e+02, best bound 1.200000000000e+02, gap 0.0% Preprocessing time: 0.04 seconds Gurobi run time: 0.10 seconds Total run time: 0.13 seconds Objective: 120 Solution: 5 x [2, 2, 2, 4, 4, 5, 5, 7, 8] 1 x [2, 2, 2, 4, 4, 7, 8] 2 x [2, 3, 6, 7, 7, 8, 8] 1 x [2, 3, 7, 7, 8, 8] 3 x [2, 3, 7, 7, 7, 7] 2 x [2, 3, 4, 7, 7, 7, 7] 28 x [2, 2, 2, 2, 4, 4, 6, 9, 10] 25 x [2, 5, 8, 9, 10, 10, 10, 10] 8 x [1, 3, 5, 8, 8, 9, 9, 9, 10] 14 x [3, 3, 3, 4, 5, 5, 9, 9, 10] 14 x [2, 4, 5, 5, 5, 5, 5, 10] 14 x [2, 2, 2, 8, 9, 9, 10, 10] 1 x [9, 9, 9, 9, 9, 9] 2 x [9, 9, 9, 9, 9, 9, 9, 9]