Build (method = -2) #dp: 2859 Step-3' Graph: 125 vertices and 393 arcs (0.01s) Step-4' Graph: 69 vertices and 281 arcs (0.01s) #V4/#V3 = 0.55 #A4/#A3 = 0.72 Ready! (0.01s) Optimize a model with 79 rows, 282 columns and 719 nonzeros Presolve removed 27 rows and 55 columns Presolve time: 0.00s Presolved: 52 rows, 227 columns, 616 nonzeros Variable types: 0 continuous, 227 integer (28 binary) Found heuristic solution: objective 94.0000000 Found heuristic solution: objective 84.0000000 Optimize a model with 52 rows, 227 columns and 616 nonzeros Presolved: 52 rows, 227 columns, 616 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.380e+02 Factor NZ : 9.130e+02 Factor Ops : 1.896e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.75337008e+02 -3.12921426e+03 3.56e+03 1.00e-01 6.23e+01 0s 1 2.43544270e+02 -1.59563253e+03 5.40e+02 5.55e-16 1.08e+01 0s 2 8.44098685e+01 -4.96429829e+02 4.70e+01 7.77e-16 1.66e+00 0s 3 5.08807087e+01 -6.97953674e+01 8.34e-01 2.78e-16 2.64e-01 0s 4 2.56258911e+01 -8.86773644e+00 2.57e-01 4.44e-16 7.53e-02 0s 5 1.49274216e+01 3.04319787e+00 9.71e-02 5.79e-16 2.59e-02 0s 6 1.39954349e+01 8.05713876e+00 4.87e-02 4.44e-16 1.29e-02 0s 7 1.27245361e+01 1.15847105e+01 5.28e-04 3.87e-16 2.47e-03 0s 8 1.25021196e+01 1.24866358e+01 4.69e-07 3.76e-16 3.35e-05 0s 9 1.25000001e+01 1.24999995e+01 8.24e-13 5.50e-16 1.36e-09 0s 10 1.25000000e+01 1.25000000e+01 1.62e-13 4.15e-16 1.36e-12 0s Barrier solved model in 10 iterations and 0.00 seconds Optimal objective 1.25000000e+01 Root relaxation: objective 1.250000e+01, 152 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 12.50000 0 11 84.00000 12.50000 85.1% - 0s H 0 0 14.0000000 12.50000 10.7% - 0s H 0 0 13.0000000 12.50000 3.85% - 0s Explored 0 nodes (243 simplex iterations) in 0.01 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.01 seconds Total run time: 0.04 seconds Objective: 13 Solution: 4 x [1, 3, 5, 5, 8, 8, 9, 9] 1 x [5, 5, 7, 8, 9, 9, 10] 1 x [4, 4, 8, 9, 10] 3 x [1, 2, 2, 5, 8, 9, 10, 10] 1 x [1, 5, 6, 8, 8, 9, 10, 10] 2 x [4, 4, 5, 8, 9, 10, 10, 10] 1 x [1, 5, 5, 8, 8, 9, 9, 9]