Build (method = -2) #dp: 2691 Step-3' Graph: 128 vertices and 430 arcs (0.01s) Step-4' Graph: 77 vertices and 329 arcs (0.01s) #V4/#V3 = 0.60 #A4/#A3 = 0.77 Ready! (0.01s) Optimize a model with 87 rows, 330 columns and 842 nonzeros Presolve removed 25 rows and 49 columns Presolve time: 0.00s Presolved: 62 rows, 281 columns, 754 nonzeros Variable types: 0 continuous, 281 integer (0 binary) Found heuristic solution: objective 96.0000000 Found heuristic solution: objective 85.0000000 Found heuristic solution: objective 76.0000000 Optimize a model with 62 rows, 281 columns and 754 nonzeros Presolved: 62 rows, 281 columns, 754 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 4.110e+02 Factor NZ : 1.108e+03 Factor Ops : 2.274e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.17378434e+03 -7.41889823e+03 4.60e+03 2.22e-16 9.42e+01 0s 1 3.33339606e+02 -3.41235134e+03 6.41e+02 8.88e-16 1.58e+01 0s 2 1.38213953e+02 -9.90182350e+02 6.40e+01 7.77e-16 2.61e+00 0s 3 8.77823165e+01 -1.25010297e+02 1.23e-02 5.00e-16 3.72e-01 0s 4 6.02970713e+01 -3.35002763e+01 5.39e-03 4.72e-16 1.64e-01 0s 5 5.07658752e+01 -2.61480299e+01 3.95e-03 7.56e-16 1.34e-01 0s 6 2.89731796e+01 -1.43259977e+01 1.41e-03 3.66e-16 7.57e-02 0s 7 1.97422895e+01 -3.90142880e+00 8.34e-04 2.86e-16 4.13e-02 0s 8 1.72248414e+01 4.47221107e+00 4.02e-04 2.36e-16 2.23e-02 0s 9 1.66365233e+01 7.48047774e+00 3.22e-04 2.85e-16 1.60e-02 0s 10 1.46400418e+01 1.35725521e+01 9.99e-06 3.56e-16 1.87e-03 0s 11 1.42861766e+01 1.42849415e+01 3.26e-14 3.33e-16 2.16e-06 0s 12 1.42857147e+01 1.42857135e+01 2.43e-14 3.33e-16 2.16e-09 0s 13 1.42857143e+01 1.42857143e+01 1.95e-14 3.23e-16 2.22e-15 0s Barrier solved model in 13 iterations and 0.00 seconds Optimal objective 1.42857143e+01 Root relaxation: objective 1.428571e+01, 178 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 76.00000 14.28571 81.2% - 0s H 0 0 16.0000000 14.28571 10.7% - 0s H 0 0 15.0000000 14.28571 4.76% - 0s Explored 0 nodes (269 simplex iterations) in 0.02 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.02 seconds Gurobi run time: 0.02 seconds Total run time: 0.04 seconds Objective: 15 Solution: 1 x [1, 2, 3, 6, 7, 9, 10] 2 x [2, 3, 3, 4, 5, 6, 10] 1 x [2, 3, 3, 4, 6, 10] 5 x [1, 2, 3, 6, 6, 9, 10] 4 x [1, 2, 3, 5, 7, 8, 9] 1 x [3, 4, 6, 10, 10, 10, 10] 1 x [6, 6, 9]