Build (method = -2) #dp: 1487 Step-3' Graph: 85 vertices and 273 arcs (0.01s) Step-4' Graph: 45 vertices and 193 arcs (0.01s) #V4/#V3 = 0.53 #A4/#A3 = 0.71 Ready! (0.01s) Optimize a model with 55 rows, 194 columns and 499 nonzeros Presolve removed 13 rows and 24 columns Presolve time: 0.00s Presolved: 42 rows, 170 columns, 456 nonzeros Variable types: 0 continuous, 170 integer (5 binary) Found heuristic solution: objective 79.0000000 Optimize a model with 42 rows, 170 columns and 456 nonzeros Presolved: 42 rows, 170 columns, 456 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.470e+02 Factor NZ : 6.050e+02 Factor Ops : 1.027e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.36446889e+02 -3.25628243e+03 2.40e+03 9.67e-02 6.12e+01 0s 1 2.64463778e+02 -1.36373913e+03 3.30e+02 4.44e-16 1.01e+01 0s 2 1.07764417e+02 -3.89648912e+02 3.42e+01 4.44e-16 1.77e+00 0s 3 5.68528752e+01 -8.45387954e+01 5.68e-02 4.16e-16 4.05e-01 0s 4 2.70285409e+01 -4.40247132e+00 9.94e-03 3.00e-16 9.01e-02 0s 5 1.86652164e+01 6.54428415e+00 4.36e-03 2.12e-16 3.47e-02 0s 6 1.82310306e+01 1.40023146e+01 8.06e-04 2.39e-16 1.21e-02 0s 7 1.67133180e+01 1.65625403e+01 2.39e-05 2.83e-16 4.32e-04 0s 8 1.66667136e+01 1.66665627e+01 2.09e-14 2.81e-16 4.32e-07 0s 9 1.66666667e+01 1.66666667e+01 8.95e-15 2.01e-16 4.33e-13 0s Barrier solved model in 9 iterations and 0.00 seconds Optimal objective 1.66666667e+01 Root relaxation: objective 1.666667e+01, 110 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 16.66667 0 12 79.00000 16.66667 78.9% - 0s H 0 0 17.0000000 16.66667 1.96% - 0s Explored 0 nodes (181 simplex iterations) in 0.01 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 1.700000000000e+01, best bound 1.700000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.01 seconds Total run time: 0.02 seconds Objective: 17 Solution: 5 x [3, 4, 6, 7, 9, 10] 1 x [2, 4, 6, 8, 10] 4 x [2, 3, 3, 4, 6, 10] 1 x [5, 6, 8, 8, 9] 2 x [2, 6, 6, 7, 8, 8] 3 x [2, 2, 5, 7, 8, 10] 1 x [1, 3, 7, 7, 9, 10]