Build (method = -2) #dp: 2295 Step-3' Graph: 147 vertices and 529 arcs (0.01s) Step-4' Graph: 98 vertices and 431 arcs (0.01s) #V4/#V3 = 0.67 #A4/#A3 = 0.81 Ready! (0.01s) Optimize a model with 108 rows, 432 columns and 1110 nonzeros Presolve removed 12 rows and 25 columns Presolve time: 0.00s Presolved: 96 rows, 407 columns, 1066 nonzeros Variable types: 0 continuous, 407 integer (14 binary) Found heuristic solution: objective 998.0000000 Found heuristic solution: objective 783.0000000 Optimize a model with 96 rows, 407 columns and 1066 nonzeros Presolved: 96 rows, 407 columns, 1066 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 6.360e+02 Factor NZ : 2.026e+03 Factor Ops : 4.791e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 8.79829063e+03 -5.35849179e+04 6.91e+04 1.24e-01 5.19e+02 0s 1 2.65748645e+03 -2.76201911e+04 1.36e+04 6.66e-16 1.10e+02 0s 2 1.14157481e+03 -9.23415493e+03 1.90e+03 5.83e-16 2.05e+01 0s 3 8.28149372e+02 -1.56608572e+03 8.74e+01 4.02e-16 3.10e+00 0s 4 5.03123590e+02 -3.18870667e+02 2.33e+01 4.58e-16 1.03e+00 0s 5 3.63605310e+02 -1.33605224e+02 1.56e+01 2.64e-16 6.26e-01 0s 6 2.48820710e+02 -5.01008031e+01 8.83e+00 2.66e-16 3.75e-01 0s 7 1.88424518e+02 4.78447280e+01 5.05e+00 2.68e-16 1.76e-01 0s 8 1.59948747e+02 1.14679369e+02 1.98e+00 3.77e-16 5.66e-02 0s 9 1.54927700e+02 1.28075034e+02 1.35e+00 2.62e-16 3.35e-02 0s 10 1.48447797e+02 1.39742199e+02 1.35e-02 3.33e-16 1.06e-02 0s 11 1.42882720e+02 1.42589985e+02 2.00e-05 2.29e-16 3.56e-04 0s 12 1.42857168e+02 1.42856876e+02 2.07e-13 1.96e-16 3.56e-07 0s 13 1.42857143e+02 1.42857143e+02 3.89e-13 2.36e-16 3.62e-13 0s Barrier solved model in 13 iterations and 0.01 seconds Optimal objective 1.42857143e+02 Root relaxation: objective 1.428571e+02, 253 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 19 783.00000 142.85714 81.8% - 0s H 0 0 146.0000000 142.85714 2.15% - 0s H 0 0 144.0000000 142.85714 0.79% - 0s 0 0 142.85714 0 32 144.00000 142.85714 0.79% - 0s H 0 0 143.0000000 142.85714 0.10% - 0s Cutting planes: Gomory: 1 Explored 0 nodes (461 simplex iterations) in 0.03 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.03 seconds Total run time: 0.05 seconds Objective: 143 Solution: 30 x [2, 5, 5, 6, 6, 6, 10] 8 x [2, 5, 5, 5, 6, 6, 10] 1 x [2, 2, 5, 6, 6, 9, 10] 36 x [1, 3, 4, 5, 8, 9, 10] 9 x [1, 1, 4, 5, 9, 9, 10] 38 x [1, 2, 5, 8, 9, 9, 9] 1 x [2, 4, 5, 5, 6, 7] 1 x [1, 2, 2, 2, 5, 8, 9] 3 x [1, 2, 2, 2, 5, 5, 8] 5 x [1, 1, 2, 2, 2, 5, 5] 11 x [1, 2, 2, 2, 2, 6, 6]