Build (method = -2) #dp: 936 Step-3' Graph: 105 vertices and 428 arcs (0.00s) Step-4' Graph: 61 vertices and 340 arcs (0.00s) #V4/#V3 = 0.58 #A4/#A3 = 0.79 Ready! (0.00s) Optimize a model with 73 rows, 341 columns and 909 nonzeros Presolve removed 9 rows and 20 columns Presolve time: 0.00s Presolved: 64 rows, 321 columns, 878 nonzeros Variable types: 0 continuous, 321 integer (0 binary) Found heuristic solution: objective 454.0000000 Found heuristic solution: objective 447.0000000 Optimize a model with 64 rows, 321 columns and 878 nonzeros Presolved: 64 rows, 321 columns, 878 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.670e+02 Factor NZ : 1.222e+03 Factor Ops : 2.705e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.85753377e+03 -1.51942623e+04 2.31e+04 2.22e-16 2.05e+02 0s 1 1.07596858e+03 -7.04487991e+03 3.43e+03 5.55e-16 3.59e+01 0s 2 4.13119708e+02 -1.99835682e+03 2.59e+02 2.11e-14 5.11e+00 0s 3 2.65275263e+02 -5.93584365e+02 8.31e+01 5.33e-15 1.59e+00 0s 4 2.63416698e+02 -2.26384231e+02 2.68e+01 2.22e-15 8.10e-01 0s 5 1.48102164e+02 -5.58298230e+01 1.23e+01 4.44e-16 3.32e-01 0s 6 1.29709473e+02 3.76707982e+01 7.08e+00 3.33e-16 1.50e-01 0s 7 1.12664724e+02 5.94790052e+01 3.02e+00 3.33e-16 8.45e-02 0s 8 1.01892101e+02 8.78254058e+01 5.54e-01 2.59e-16 2.18e-02 0s 9 9.93281878e+01 9.77428058e+01 1.29e-01 2.22e-16 2.48e-03 0s 10 9.88010992e+01 9.87960430e+01 3.13e-12 2.43e-16 7.73e-06 0s 11 9.88000011e+01 9.87999960e+01 2.35e-13 2.22e-16 7.73e-09 0s 12 9.88000000e+01 9.88000000e+01 5.88e-13 3.33e-16 7.73e-12 0s Barrier solved model in 12 iterations and 0.00 seconds Optimal objective 9.88000000e+01 Root relaxation: objective 9.880000e+01, 179 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 98.80000 0 16 447.00000 98.80000 77.9% - 0s H 0 0 103.0000000 98.80000 4.08% - 0s 0 0 98.80000 0 12 103.00000 98.80000 4.08% - 0s H 0 0 99.0000000 98.80000 0.20% - 0s Cutting planes: Gomory: 3 Explored 0 nodes (222 simplex iterations) in 0.02 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 9.900000000000e+01, best bound 9.900000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.02 seconds Total run time: 0.03 seconds Objective: 99 Solution: 8 x [1, 5, 6, 8, 9] 1 x [8, 10, 11, 11, 12] 12 x [5, 5, 8, 11, 11] 2 x [8, 8, 10, 11, 11] 5 x [8, 8, 9, 9, 10] 8 x [2, 4, 6, 9, 9] 3 x [4, 4, 4, 11, 12] 6 x [4, 4, 4, 9, 11] 4 x [3, 5, 5, 5, 7] 1 x [3, 5, 5, 7, 7] 4 x [3, 5, 7, 7, 7] 1 x [5, 6, 6, 11] 1 x [5, 5, 5, 6, 6] 43 x [5, 5, 5, 5, 5]