Build (method = -2) #dp: 2712 Step-3' Graph: 141 vertices and 479 arcs (0.01s) Step-4' Graph: 91 vertices and 379 arcs (0.01s) #V4/#V3 = 0.65 #A4/#A3 = 0.79 Ready! (0.01s) Optimize a model with 100 rows, 380 columns and 969 nonzeros Presolve removed 26 rows and 51 columns Presolve time: 0.00s Presolved: 74 rows, 329 columns, 876 nonzeros Variable types: 0 continuous, 329 integer (0 binary) Found heuristic solution: objective 995.0000000 Found heuristic solution: objective 773.0000000 Optimize a model with 74 rows, 329 columns and 876 nonzeros Presolved: 74 rows, 329 columns, 876 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.900e+02 Factor NZ : 1.405e+03 Factor Ops : 2.997e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.63410743e+03 -3.09309165e+04 2.94e+04 1.11e-16 2.78e+02 0s 1 1.33556439e+03 -1.28701908e+04 3.80e+03 4.44e-16 4.54e+01 0s 2 7.80845252e+02 -3.17601642e+03 3.19e+02 8.33e-16 7.25e+00 0s 3 3.82723855e+02 -3.95800574e+02 7.40e+00 4.16e-16 1.18e+00 0s 4 2.25435905e+02 -7.72524709e+01 2.42e+00 2.71e-16 4.57e-01 0s 5 1.74466705e+02 6.21462000e+00 1.22e+00 2.72e-16 2.54e-01 0s 6 1.43061970e+02 8.12643631e+01 5.79e-01 2.44e-16 9.32e-02 0s 7 1.32515971e+02 1.03172337e+02 2.86e-01 2.99e-16 4.42e-02 0s 8 1.34894904e+02 1.13034097e+02 1.58e-01 2.22e-16 3.29e-02 0s 9 1.32625361e+02 1.15143005e+02 1.29e-01 2.62e-16 2.63e-02 0s 10 1.26868979e+02 1.21302926e+02 4.19e-02 3.26e-16 8.37e-03 0s 11 1.25043925e+02 1.24823471e+02 2.26e-11 2.68e-16 3.31e-04 0s 12 1.25000045e+02 1.24999824e+02 1.17e-10 2.22e-16 3.31e-07 0s 13 1.25000000e+02 1.25000000e+02 3.22e-11 1.87e-16 3.31e-13 0s Barrier solved model in 13 iterations and 0.00 seconds Optimal objective 1.25000000e+02 Root relaxation: objective 1.250000e+02, 186 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 38 773.00000 125.00000 83.8% - 0s H 0 0 127.0000000 125.00000 1.57% - 0s H 0 0 126.0000000 125.00000 0.79% - 0s 0 0 125.00000 0 33 126.00000 125.00000 0.79% - 0s * 0 0 0 125.0000000 125.00000 0.0% - 0s Explored 0 nodes (654 simplex iterations) in 0.05 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.02 seconds Gurobi run time: 0.05 seconds Total run time: 0.07 seconds Objective: 125 Solution: 38 x [3, 4, 4, 4, 5, 6, 6, 7] 5 x [2, 2, 3, 3, 4, 4, 4, 5] 2 x [2, 2, 4, 4, 4, 5, 6, 6] 1 x [2, 2, 4, 4, 5, 5, 6, 6] 37 x [1, 1, 4, 4, 4, 5, 5, 6] 26 x [1, 1, 1, 4, 4, 4, 5, 5] 14 x [2, 3, 4, 8, 8, 8, 8, 9] 1 x [4, 6, 6, 8, 8, 8, 8, 9] 1 x [3, 4, 4, 4, 6, 6, 7, 8]