Build (method = -2) #dp: 2509 Step-3' Graph: 147 vertices and 505 arcs (0.01s) Step-4' Graph: 103 vertices and 417 arcs (0.01s) #V4/#V3 = 0.70 #A4/#A3 = 0.83 Ready! (0.01s) Optimize a model with 113 rows, 418 columns and 1058 nonzeros Presolve removed 20 rows and 40 columns Presolve time: 0.00s Presolved: 93 rows, 378 columns, 984 nonzeros Variable types: 0 continuous, 378 integer (0 binary) Found heuristic solution: objective 935.0000000 Optimize a model with 93 rows, 378 columns and 984 nonzeros Presolved: 93 rows, 378 columns, 984 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 5.970e+02 Factor NZ : 1.931e+03 Factor Ops : 4.746e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.28302786e+03 -3.95749861e+04 3.51e+04 2.22e-16 3.02e+02 0s 1 1.50304690e+03 -1.74660339e+04 5.31e+03 5.55e-16 5.49e+01 0s 2 9.27247506e+02 -4.61966308e+03 7.41e+02 4.44e-16 1.01e+01 0s 3 5.58451376e+02 -9.37518461e+02 2.16e+01 8.19e-16 2.00e+00 0s 4 3.53818297e+02 -2.37514716e+02 1.16e+01 2.67e-16 7.89e-01 0s 5 2.63096416e+02 -1.62823240e+02 6.77e+00 3.05e-16 5.65e-01 0s 6 1.92632203e+02 -2.80448287e+01 3.21e+00 2.05e-16 2.92e-01 0s 7 1.67209025e+02 2.46089352e+01 1.73e+00 2.09e-16 1.88e-01 0s 8 1.53990987e+02 1.24110064e+02 7.95e-01 3.10e-16 3.96e-02 0s 9 1.43902525e+02 1.40245751e+02 3.82e-13 2.22e-16 4.77e-03 0s 10 1.42858479e+02 1.42834968e+02 2.09e-13 3.33e-16 3.07e-05 0s 11 1.42857144e+02 1.42857121e+02 2.86e-13 2.22e-16 3.07e-08 0s 12 1.42857143e+02 1.42857143e+02 1.81e-13 2.22e-16 3.07e-11 0s Barrier solved model in 12 iterations and 0.00 seconds Optimal objective 1.42857143e+02 Root relaxation: objective 1.428571e+02, 233 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 142.85714 0 25 935.00000 142.85714 84.7% - 0s H 0 0 145.0000000 142.85714 1.48% - 0s H 0 0 144.0000000 142.85714 0.79% - 0s * 0 0 0 143.0000000 143.00000 0.0% - 0s Cutting planes: Gomory: 4 MIR: 1 Mod-K: 2 Explored 0 nodes (501 simplex iterations) in 0.04 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.430000000000e+02, best bound 1.430000000000e+02, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.04 seconds Total run time: 0.05 seconds Objective: 143 Solution: 51 x [1, 2, 2, 5, 7, 9, 10] 9 x [1, 2, 2, 5, 7, 10, 10] 24 x [1, 5, 9, 10, 10, 10, 10] 19 x [4, 5, 5, 6, 6, 9, 10] 1 x [2, 2, 2, 5, 6, 10] 13 x [2, 2, 2, 5, 6, 6, 10] 1 x [2, 2, 2, 5, 8, 10, 10] 4 x [2, 3, 4, 4, 4, 5, 8] 4 x [2, 2, 5, 7, 8, 8, 8] 17 x [3, 5, 8, 8, 8, 8, 8]