Build (method = -2) #dp: 1776 Step-3' Graph: 71 vertices and 204 arcs (0.01s) Step-4' Graph: 17 vertices and 96 arcs (0.01s) #V4/#V3 = 0.24 #A4/#A3 = 0.47 Ready! (0.01s) Optimize a model with 27 rows, 97 columns and 265 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 25 rows, 95 columns, 261 nonzeros Variable types: 0 continuous, 95 integer (6 binary) Found heuristic solution: objective 93.0000000 Found heuristic solution: objective 81.0000000 Optimize a model with 25 rows, 95 columns and 261 nonzeros Presolved: 25 rows, 95 columns, 261 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.160e+02 Factor NZ : 2.690e+02 Factor Ops : 3.677e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.58910935e+02 -1.27777467e+03 6.88e+02 6.66e-02 4.50e+01 0s 1 1.72856281e+02 -5.98627973e+02 6.99e+01 4.44e-16 6.79e+00 0s 2 6.10600778e+01 -8.84695561e+01 9.81e-01 4.44e-16 7.69e-01 0s 3 2.25039754e+01 -3.99216943e+00 1.16e-01 5.27e-16 1.34e-01 0s 4 1.57920007e+01 1.11808402e+01 2.37e-02 5.72e-16 2.32e-02 0s 5 1.47288317e+01 1.40950937e+01 7.39e-03 3.86e-16 3.18e-03 0s 6 1.42863920e+01 1.42830594e+01 5.39e-06 4.71e-16 1.67e-05 0s 7 1.42857143e+01 1.42857143e+01 5.72e-12 4.10e-16 1.93e-11 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 1.42857143e+01 Root relaxation: objective 1.428571e+01, 68 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 14.28571 0 10 81.00000 14.28571 82.4% - 0s H 0 0 15.0000000 14.28571 4.76% - 0s Explored 0 nodes (80 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.500000000000e+01, best bound 1.500000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.02 seconds Objective: 15 Solution: 2 x [1, 4, 6, 7, 8, 10, 10] 8 x [1, 2, 3, 5, 7, 8, 10] 3 x [1, 3, 3, 6, 7, 7, 10] 1 x [3, 8, 10] 1 x [2, 3, 3, 7, 7, 9]