Build (method = -2) #dp: 1713 Step-3' Graph: 170 vertices and 583 arcs (0.01s) Step-4' Graph: 119 vertices and 481 arcs (0.01s) #V4/#V3 = 0.70 #A4/#A3 = 0.83 Ready! (0.01s) Optimize a model with 128 rows, 482 columns and 1218 nonzeros Presolve removed 24 rows and 48 columns Presolve time: 0.01s Presolved: 104 rows, 434 columns, 1133 nonzeros Variable types: 0 continuous, 434 integer (57 binary) Found heuristic solution: objective 91.0000000 Optimize a model with 104 rows, 434 columns and 1133 nonzeros Presolved: 104 rows, 434 columns, 1133 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 6.830e+02 Factor NZ : 2.290e+03 Factor Ops : 5.720e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 8.62679188e+02 -7.14522196e+03 7.24e+03 1.06e-01 5.21e+01 0s 1 2.76504881e+02 -3.44845027e+03 1.43e+03 3.89e-16 1.14e+01 0s 2 1.38575567e+02 -1.01622698e+03 1.72e+02 4.44e-16 1.96e+00 0s 3 9.42051897e+01 -1.53841743e+02 8.36e+00 5.00e-16 3.00e-01 0s 4 4.38379931e+01 -6.08653746e+01 2.78e+00 2.22e-16 1.24e-01 0s 5 3.04331255e+01 -1.41029145e+01 1.83e+00 2.58e-16 5.34e-02 0s 6 2.23114074e+01 -6.49342728e+00 1.15e+00 2.02e-16 3.44e-02 0s 7 1.86277005e+01 1.59928809e+00 7.47e-01 2.22e-16 2.03e-02 0s 8 1.44087354e+01 7.88024802e+00 2.93e-01 2.25e-16 7.69e-03 0s 9 1.35504503e+01 1.08168621e+01 1.92e-01 2.22e-16 3.24e-03 0s 10 1.26584509e+01 1.21084751e+01 3.75e-02 2.85e-16 6.44e-04 0s 11 1.25008179e+01 1.24952507e+01 6.08e-13 3.33e-16 6.36e-06 0s 12 1.25000008e+01 1.24999953e+01 1.63e-11 2.70e-16 6.36e-09 0s 13 1.25000000e+01 1.25000000e+01 9.26e-13 2.22e-16 6.60e-15 0s Barrier solved model in 13 iterations and 0.01 seconds Optimal objective 1.25000000e+01 Root relaxation: objective 1.250000e+01, 246 iterations, 0.01 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 12.50000 0 27 91.00000 12.50000 86.3% - 0s H 0 0 14.0000000 12.50000 10.7% - 0s 0 0 12.50000 0 47 14.00000 12.50000 10.7% - 0s H 0 0 13.0000000 12.50000 3.85% - 0s Cutting planes: Gomory: 2 Mod-K: 1 Explored 0 nodes (409 simplex iterations) in 0.04 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.300000000000e+01, best bound 1.300000000000e+01, gap 0.0% Preprocessing time: 0.02 seconds Gurobi run time: 0.04 seconds Total run time: 0.06 seconds Objective: 13 Solution: 3 x [2, 2, 3, 3, 3, 3, 4, 8] 1 x [2, 2, 3, 4, 8, 8, 9, 9] 1 x [1, 3, 4, 5] 1 x [3, 3, 6, 7, 7, 7, 9, 9] 1 x [1, 1, 2, 3, 3, 4, 7, 7] 2 x [3, 3, 3, 7, 7, 7, 7, 7] 3 x [1, 2, 7, 7, 9, 9, 9, 9] 1 x [1, 4, 7, 7, 9, 9, 9, 9]