Build (method = -2) #dp: 3804 Step-3' Graph: 418 vertices and 1983 arcs (0.02s) Step-4' Graph: 398 vertices and 1943 arcs (0.02s) #V4/#V3 = 0.95 #A4/#A3 = 0.98 Ready! (0.02s) Optimize a model with 408 rows, 1944 columns and 5058 nonzeros Presolve removed 55 rows and 104 columns Presolve time: 0.02s Presolved: 353 rows, 1840 columns, 4950 nonzeros Variable types: 0 continuous, 1840 integer (0 binary) Found heuristic solution: objective 973.0000000 Optimize a model with 353 rows, 1840 columns and 4950 nonzeros Presolved: 353 rows, 1840 columns, 4950 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.888e+03 Factor NZ : 1.525e+04 (roughly 1 MByte of memory) Factor Ops : 1.068e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 7.06506596e+03 -3.90460377e+05 2.24e+05 2.22e-16 6.44e+02 0s 1 2.20135606e+03 -2.41349358e+05 3.96e+04 6.66e-16 1.51e+02 0s 2 1.51707336e+03 -7.82496383e+04 1.35e+04 1.95e-14 4.52e+01 0s 3 1.07297728e+03 -2.26779580e+04 2.03e+03 1.33e-15 9.40e+00 0s 4 9.85472797e+02 -4.07872750e+03 1.17e+02 5.33e-15 1.47e+00 0s 5 9.05989535e+02 -2.04564803e+03 4.36e-01 3.44e-15 8.00e-01 0s 6 8.48231468e+02 -1.97516593e+03 3.54e-01 3.33e-15 7.66e-01 0s 7 7.49618150e+02 -9.96078620e+02 1.70e-01 1.78e-15 4.73e-01 0s 8 5.33383189e+02 -9.61346035e+02 1.10e-01 2.00e-15 4.05e-01 0s 9 4.09191781e+02 -5.40393789e+02 7.47e-02 8.88e-16 2.57e-01 0s 10 2.41659232e+02 -1.25254606e+02 3.51e-02 4.44e-16 9.94e-02 0s 11 1.85097396e+02 1.09910810e+01 2.17e-02 3.33e-16 4.72e-02 0s 12 1.63293213e+02 3.99344640e+01 1.34e-02 2.19e-16 3.34e-02 0s 13 1.48903573e+02 8.05383026e+01 7.53e-03 2.22e-16 1.85e-02 0s 14 1.40001441e+02 9.88911120e+01 5.02e-03 2.17e-16 1.11e-02 0s 15 1.38198724e+02 1.11912620e+02 4.33e-03 3.58e-16 7.12e-03 0s 16 1.30398377e+02 1.18152999e+02 1.81e-03 2.18e-16 3.32e-03 0s 17 1.26614344e+02 1.20064781e+02 5.98e-04 2.32e-16 1.78e-03 0s 18 1.25462602e+02 1.22062291e+02 2.48e-04 2.22e-16 9.22e-04 0s 19 1.24965727e+02 1.22823152e+02 1.32e-04 2.11e-16 5.81e-04 0s 20 1.24928140e+02 1.23085472e+02 1.21e-04 1.86e-16 4.99e-04 0s 21 1.24556617e+02 1.23646735e+02 4.58e-05 2.14e-16 2.47e-04 0s 22 1.24371529e+02 1.23995337e+02 1.70e-05 2.09e-16 1.02e-04 0s 23 1.24277837e+02 1.24096342e+02 7.18e-06 2.99e-16 4.92e-05 0s 24 1.24237967e+02 1.24141445e+02 3.68e-06 2.30e-16 2.62e-05 0s 25 1.24236505e+02 1.24156375e+02 3.37e-06 2.13e-16 2.17e-05 0s 26 1.24220482e+02 1.24177839e+02 1.66e-06 2.38e-16 1.16e-05 0s 27 1.24219007e+02 1.24184883e+02 1.51e-06 2.22e-16 9.25e-06 0s 28 1.24205789e+02 1.24203531e+02 3.42e-08 1.86e-16 6.12e-07 0s 29 1.24205001e+02 1.24204999e+02 2.21e-12 2.98e-16 6.21e-10 0s 30 1.24205000e+02 1.24205000e+02 2.84e-12 2.27e-16 6.55e-16 0s Barrier solved model in 30 iterations and 0.07 seconds Optimal objective 1.24205000e+02 Root relaxation: objective 1.242050e+02, 441 iterations, 0.07 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 124.20500 0 40 973.00000 124.20500 87.2% - 0s H 0 0 125.0000000 124.20500 0.64% - 0s Explored 0 nodes (1283 simplex iterations) in 0.22 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.22 seconds Total run time: 0.25 seconds Objective: 125 Solution: 25 x [3, 3, 3, 3, 5, 7, 9, 10] 14 x [1, 4, 4, 7, 8, 10, 10] 28 x [2, 4, 4, 6, 6, 7, 7, 7] 2 x [1, 4, 4, 4, 7, 8, 8, 9] 17 x [3, 3, 3, 5, 7, 7, 7, 9] 1 x [3, 6, 6, 6, 7, 7, 7, 9, 9] 5 x [3, 6, 6, 6, 6, 7, 7, 7, 9, 9] 22 x [4, 4, 8, 8, 8, 8, 8, 9] 1 x [1, 4, 4, 4, 8, 8, 9] 1 x [1, 4, 4, 4, 9] 8 x [1, 3, 5, 8, 8, 8, 8, 8, 9] 1 x [1, 9, 9, 9, 9, 9, 9]