Build (method = -2) #dp: 7352 Step-3' Graph: 287 vertices and 1076 arcs (0.04s) Step-4' Graph: 222 vertices and 946 arcs (0.04s) #V4/#V3 = 0.77 #A4/#A3 = 0.88 Ready! (0.04s) Optimize a model with 232 rows, 947 columns and 2409 nonzeros Presolve removed 61 rows and 119 columns Presolve time: 0.01s Presolved: 171 rows, 828 columns, 2237 nonzeros Variable types: 0 continuous, 828 integer (0 binary) Found heuristic solution: objective 1000.0000000 Optimize a model with 171 rows, 828 columns and 2237 nonzeros Presolved: 171 rows, 828 columns, 2237 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.278e+03 Factor NZ : 4.318e+03 Factor Ops : 1.261e+05 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.98840711e+03 -1.25993893e+05 1.09e+05 2.22e-16 4.53e+02 0s 1 2.26538347e+03 -6.21213912e+04 2.11e+04 1.11e-15 9.91e+01 0s 2 1.30730746e+03 -2.13806988e+04 4.56e+03 1.33e-15 2.37e+01 0s 3 1.01660668e+03 -4.32391276e+03 4.67e+02 1.22e-15 3.92e+00 0s 4 7.94930081e+02 -1.73443254e+03 7.03e-02 1.33e-15 1.52e+00 0s 5 5.16639894e+02 -9.06929053e+02 3.62e-02 8.88e-16 8.55e-01 0s 6 3.13529259e+02 -4.72333211e+02 1.63e-02 4.44e-16 4.72e-01 0s 7 1.81002196e+02 -2.19865373e+02 6.16e-03 2.64e-16 2.41e-01 0s 8 1.37231678e+02 -1.99069689e+01 3.39e-03 3.33e-16 9.43e-02 0s 9 1.25290696e+02 3.38923190e+01 1.85e-03 2.22e-16 5.49e-02 0s 10 1.25401722e+02 8.24391689e+01 1.42e-03 2.65e-16 2.58e-02 0s 11 1.13048802e+02 1.06414659e+02 1.22e-04 2.22e-16 3.98e-03 0s 12 1.11122360e+02 1.11058954e+02 2.07e-07 3.71e-16 3.81e-05 0s 13 1.11111111e+02 1.11111111e+02 2.59e-12 2.22e-16 1.31e-10 0s Barrier solved model in 13 iterations and 0.01 seconds Optimal objective 1.11111111e+02 Root relaxation: objective 1.111111e+02, 450 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 111.11111 0 29 1000.00000 111.11111 88.9% - 0s H 0 0 112.0000000 111.11111 0.79% - 0s Explored 0 nodes (970 simplex iterations) in 0.06 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.05 seconds Gurobi run time: 0.06 seconds Total run time: 0.10 seconds Objective: 112 Solution: 17 x [4, 5, 6, 6, 6, 8, 8, 8, 10] 14 x [1, 1, 1, 1, 3, 4, 5, 10, 10] 6 x [1, 1, 1, 1, 1, 4, 4, 4, 5] 1 x [3, 3, 3, 4, 5, 5, 8, 8, 8] 1 x [1, 1, 1, 1, 3, 4, 5, 5, 10] 1 x [1, 1, 1, 1, 4, 5, 5, 6] 8 x [1, 1, 1, 1, 4, 5, 5, 6, 6] 1 x [1, 1, 1, 1, 3, 4, 5, 5] 18 x [2, 3, 4, 5, 5, 5, 6, 9, 10] 27 x [2, 2, 4, 5, 5, 5, 6, 9, 10] 1 x [7, 7, 8] 17 x [7, 7, 7, 7, 7, 7, 7, 7, 8]