Build (method = -2) #dp: 3889 Step-3' Graph: 208 vertices and 780 arcs (0.02s) Step-4' Graph: 165 vertices and 694 arcs (0.02s) #V4/#V3 = 0.79 #A4/#A3 = 0.89 Ready! (0.02s) Optimize a model with 174 rows, 695 columns and 1767 nonzeros Presolve removed 38 rows and 77 columns Presolve time: 0.01s Presolved: 136 rows, 618 columns, 1632 nonzeros Variable types: 0 continuous, 618 integer (0 binary) Found heuristic solution: objective 911.0000000 Found heuristic solution: objective 822.0000000 Found heuristic solution: objective 804.0000000 Optimize a model with 136 rows, 618 columns and 1632 nonzeros Presolved: 136 rows, 618 columns, 1632 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 9.360e+02 Factor NZ : 3.258e+03 Factor Ops : 9.311e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.02646242e+03 -5.03952957e+04 4.67e+04 1.11e-16 2.51e+02 0s 1 1.32192200e+03 -2.20367952e+04 6.92e+03 5.55e-16 4.51e+01 0s 2 8.89201488e+02 -6.62977108e+03 8.57e+02 6.66e-16 8.39e+00 0s 3 6.04010990e+02 -1.18002123e+03 3.08e+01 5.00e-16 1.47e+00 0s 4 3.81892447e+02 -6.13627292e+02 1.26e+01 3.64e-16 8.13e-01 0s 5 2.87099745e+02 -4.38107466e+02 7.67e+00 3.43e-16 5.90e-01 0s 6 1.99901841e+02 -1.23766492e+02 2.93e+00 3.37e-16 2.62e-01 0s 7 1.64115749e+02 -4.32890731e+01 1.50e+00 3.64e-16 1.68e-01 0s 8 1.50054035e+02 1.31149631e+01 6.69e-01 3.30e-16 1.10e-01 0s 9 1.34445967e+02 7.99409781e+01 3.54e-01 2.57e-16 4.39e-02 0s 10 1.29008420e+02 1.03162359e+02 1.75e-01 2.38e-16 2.08e-02 0s 11 1.25142020e+02 1.14959291e+02 4.12e-02 2.80e-16 8.19e-03 0s 12 1.23668703e+02 1.21098019e+02 7.27e-03 2.31e-16 2.07e-03 0s 13 1.23332222e+02 1.22153226e+02 2.94e-03 2.37e-16 9.48e-04 0s 14 1.23162974e+02 1.22663666e+02 1.26e-03 2.47e-16 4.01e-04 0s 15 1.23037568e+02 1.22786105e+02 4.30e-04 3.33e-16 2.02e-04 0s 16 1.22988553e+02 1.22888955e+02 1.28e-04 3.33e-16 8.00e-05 0s 17 1.22968276e+02 1.22931670e+02 4.19e-05 3.33e-16 2.94e-05 0s 18 1.22957524e+02 1.22954500e+02 1.62e-06 3.33e-16 2.43e-06 0s 19 1.22956798e+02 1.22956764e+02 8.27e-09 2.42e-16 2.72e-08 0s 20 1.22956790e+02 1.22956790e+02 2.60e-11 3.07e-16 2.72e-11 0s Barrier solved model in 20 iterations and 0.01 seconds Optimal objective 1.22956790e+02 Root relaxation: objective 1.229568e+02, 101 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 122.95679 0 37 804.00000 122.95679 84.7% - 0s H 0 0 126.0000000 122.95679 2.42% - 0s H 0 0 124.0000000 122.95679 0.84% - 0s 0 0 122.95874 0 39 124.00000 122.95874 0.84% - 0s 0 0 122.95874 0 28 124.00000 122.95874 0.84% - 0s H 0 0 123.0000000 122.95874 0.03% - 0s Explored 0 nodes (454 simplex iterations) in 0.09 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.230000000000e+02, best bound 1.230000000000e+02, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.09 seconds Total run time: 0.12 seconds Objective: 123 Solution: 1 x [3, 3, 4, 5, 7, 7, 7, 8] 14 x [2, 3, 3, 3, 4, 4, 5, 8, 9] 9 x [2, 3, 3, 4, 5, 5, 8, 8] 7 x [4, 5, 5, 7, 7, 7, 7] 63 x [1, 1, 4, 4, 4, 5, 5, 6] 2 x [1, 1, 1, 4, 7, 8, 8, 8, 8] 20 x [4, 4, 4, 4, 6, 6, 6, 8] 6 x [1, 1, 1, 2, 4, 4, 4, 4, 7] 1 x [1, 1, 2, 3, 4, 4, 4, 4, 9]