Build (method = -2) #dp: 4723 Step-3' Graph: 225 vertices and 877 arcs (0.02s) Step-4' Graph: 164 vertices and 755 arcs (0.02s) #V4/#V3 = 0.73 #A4/#A3 = 0.86 Ready! (0.02s) Optimize a model with 174 rows, 756 columns and 1951 nonzeros Presolve removed 42 rows and 84 columns Presolve time: 0.01s Presolved: 132 rows, 672 columns, 1821 nonzeros Variable types: 0 continuous, 672 integer (0 binary) Found heuristic solution: objective 911.0000000 Found heuristic solution: objective 866.0000000 Optimize a model with 132 rows, 672 columns and 1821 nonzeros Presolved: 132 rows, 672 columns, 1821 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.033e+03 Factor NZ : 3.350e+03 Factor Ops : 9.784e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.27887320e+03 -7.05611743e+04 6.31e+04 2.22e-16 3.12e+02 0s 1 1.64655500e+03 -3.39589658e+04 1.05e+04 5.55e-16 6.30e+01 0s 2 9.75060306e+02 -1.01311489e+04 2.01e+03 6.11e-16 1.36e+01 0s 3 7.63239720e+02 -1.44730756e+03 9.63e+01 1.55e-15 1.78e+00 0s 4 4.55722147e+02 -6.42185920e+02 2.39e+01 6.66e-16 8.37e-01 0s 5 3.13614249e+02 -3.68782077e+02 1.37e+01 4.44e-16 5.17e-01 0s 6 2.20752271e+02 -1.63404807e+02 7.22e+00 4.44e-16 2.90e-01 0s 7 1.71675984e+02 -1.43236372e+01 4.23e+00 2.39e-16 1.41e-01 0s 8 1.40580376e+02 6.27115962e+01 2.23e+00 3.33e-16 5.90e-02 0s 9 1.38606476e+02 8.69514630e+01 1.49e+00 2.22e-16 3.89e-02 0s 10 1.30908001e+02 1.19476093e+02 6.24e-01 3.41e-16 8.65e-03 0s 11 1.25090788e+02 1.24713528e+02 1.35e-12 1.88e-16 2.79e-04 0s 12 1.25000091e+02 1.24999713e+02 2.29e-13 3.33e-16 2.79e-07 0s 13 1.25000000e+02 1.25000000e+02 1.84e-13 2.26e-16 2.80e-13 0s Barrier solved model in 13 iterations and 0.01 seconds Optimal objective 1.25000000e+02 Root relaxation: objective 1.250000e+02, 380 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 125.00000 0 19 866.00000 125.00000 85.6% - 0s H 0 0 126.0000000 125.00000 0.79% - 0s * 0 0 0 125.0000000 125.00000 0.0% - 0s Cutting planes: Gomory: 1 MIR: 2 Zero half: 2 Explored 0 nodes (877 simplex iterations) in 0.06 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.06 seconds Total run time: 0.10 seconds Objective: 125 Solution: 46 x [1, 4, 5, 5, 5, 9, 10, 10] 3 x [1, 1, 1, 1, 4, 8, 10, 10] 1 x [1, 1, 1, 1, 2, 4, 10, 10] 22 x [1, 1, 2, 2, 4, 10, 10, 10] 1 x [1, 1, 1, 1, 4, 10, 10, 10] 6 x [1, 1, 4, 6, 6, 7, 7, 8] 3 x [1, 1, 4, 4, 6, 7, 7, 7] 1 x [1, 1, 1, 3, 3, 7, 7, 7] 6 x [1, 1, 4, 7, 7, 7, 8, 9] 10 x [1, 4, 5, 5, 5, 7, 7, 7] 26 x [1, 1, 3, 3, 3, 3, 4, 8]