Build (method = -2) #dp: 4458 Step-3' Graph: 339 vertices and 1281 arcs (0.02s) Step-4' Graph: 259 vertices and 1121 arcs (0.02s) #V4/#V3 = 0.76 #A4/#A3 = 0.88 Ready! (0.02s) Optimize a model with 269 rows, 1122 columns and 2860 nonzeros Presolve removed 64 rows and 125 columns Presolve time: 0.01s Presolved: 205 rows, 997 columns, 2691 nonzeros Variable types: 0 continuous, 997 integer (0 binary) Found heuristic solution: objective 987.0000000 Optimize a model with 205 rows, 997 columns and 2691 nonzeros Presolved: 205 rows, 997 columns, 2691 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.587e+03 Factor NZ : 5.814e+03 Factor Ops : 1.981e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 8.13504293e+03 -1.78955923e+05 1.55e+05 1.11e-16 6.30e+02 0s 1 2.43475075e+03 -1.03092229e+05 2.45e+04 4.66e-15 1.27e+02 0s 2 1.47581309e+03 -3.58299984e+04 6.06e+03 2.55e-15 3.39e+01 0s 3 1.05368465e+03 -6.73005264e+03 7.91e+02 5.55e-15 5.41e+00 0s 4 9.73764259e+02 -1.31853056e+03 1.96e-12 2.16e-15 1.14e+00 0s 5 7.42733857e+02 -1.09711373e+03 1.26e-12 2.40e-15 9.18e-01 0s 6 7.39032379e+02 -7.47433338e+02 1.40e-12 2.60e-15 7.42e-01 0s 7 4.80133106e+02 -7.80835746e+02 9.37e-13 3.21e-15 6.29e-01 0s 8 3.73019521e+02 -3.23483978e+02 1.08e-12 3.03e-15 3.48e-01 0s 9 1.96866509e+02 -2.01586042e+02 1.12e-12 3.37e-15 1.99e-01 0s 10 1.85524991e+02 -1.65482933e+02 1.17e-12 3.41e-15 1.75e-01 0s 11 1.72665015e+02 -5.37719495e+01 1.03e-12 2.38e-15 1.13e-01 0s 12 1.49548288e+02 7.18764613e+00 5.20e-13 2.69e-15 7.10e-02 0s 13 1.37181180e+02 5.52380532e+01 4.78e-13 2.63e-15 4.09e-02 0s 14 1.20053502e+02 9.15754500e+01 2.34e-13 1.97e-15 1.42e-02 0s 15 1.15490934e+02 1.06916436e+02 5.68e-13 2.02e-15 4.28e-03 0s 16 1.11516240e+02 1.10122421e+02 5.01e-12 2.49e-15 6.96e-04 0s 17 1.11111728e+02 1.11108254e+02 8.40e-12 1.69e-15 1.73e-06 0s 18 1.11111111e+02 1.11111111e+02 2.28e-10 1.70e-15 2.91e-12 0s Barrier solved model in 18 iterations and 0.02 seconds Optimal objective 1.11111111e+02 Root relaxation: objective 1.111111e+02, 541 iterations, 0.02 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 111.11111 0 27 987.00000 111.11111 88.7% - 0s H 0 0 112.0000000 111.11111 0.79% - 0s Explored 0 nodes (1165 simplex iterations) in 0.08 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.120000000000e+02, best bound 1.120000000000e+02, gap 0.0% Preprocessing time: 0.03 seconds Gurobi run time: 0.08 seconds Total run time: 0.11 seconds Objective: 112 Solution: 15 x [1, 5, 7, 8, 8, 9, 10, 10, 10] 1 x [5, 8, 8, 9, 9, 9, 10, 10, 10] 1 x [8, 8, 9, 9, 10] 33 x [4, 5, 5, 7, 7, 9, 10, 10, 10] 5 x [4, 5, 5, 9, 9, 9, 10, 10, 10] 21 x [3, 3, 3, 3, 3, 4, 5, 5, 6] 15 x [3, 3, 3, 3, 5, 6, 6, 6, 6] 6 x [3, 3, 3, 3, 5, 5, 5, 5, 10] 1 x [2, 3, 3, 3, 10, 10, 10, 10] 6 x [2, 2, 3, 3, 3, 10, 10, 10, 10] 7 x [3, 3, 3, 10, 10, 10, 10, 10, 10] 1 x [3, 6, 6, 6, 6, 6]