Build (method = -2) #dp: 1341 Step-3' Graph: 60 vertices and 186 arcs (0.01s) Step-4' Graph: 24 vertices and 114 arcs (0.01s) #V4/#V3 = 0.40 #A4/#A3 = 0.61 Ready! (0.01s) Optimize a model with 34 rows, 115 columns and 301 nonzeros Presolve removed 9 rows and 16 columns Presolve time: 0.00s Presolved: 25 rows, 99 columns, 269 nonzeros Variable types: 0 continuous, 99 integer (0 binary) Found heuristic solution: objective 83.0000000 Found heuristic solution: objective 65.0000000 Optimize a model with 25 rows, 99 columns and 269 nonzeros Presolved: 25 rows, 99 columns, 269 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.310e+02 Factor NZ : 2.750e+02 Factor Ops : 3.725e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.25023018e+02 -2.01245279e+03 4.77e+02 1.11e-16 5.00e+01 0s 1 1.76264385e+02 -7.72968517e+02 5.53e+01 5.55e-16 7.88e+00 0s 2 7.04543282e+01 -1.46693539e+02 1.10e+00 4.44e-16 1.08e+00 0s 3 3.33418015e+01 -1.49471752e+01 8.15e-02 2.22e-16 2.34e-01 0s 4 1.94457591e+01 8.96403648e+00 2.00e-02 2.69e-16 5.07e-02 0s 5 1.79906955e+01 1.56739611e+01 6.00e-03 3.33e-16 1.12e-02 0s 6 1.68398059e+01 1.68077250e+01 1.52e-05 3.33e-16 1.55e-04 0s 7 1.68333333e+01 1.68333333e+01 2.16e-11 2.22e-16 3.42e-10 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 1.68333333e+01 Root relaxation: objective 1.683333e+01, 65 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 16.83333 0 10 65.00000 16.83333 74.1% - 0s H 0 0 17.0000000 16.83333 0.98% - 0s Explored 0 nodes (81 simplex iterations) in 0.00 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.00 seconds Total run time: 0.02 seconds Objective: 17 Solution: 2 x [1, 1, 6, 7, 8, 10] 7 x [1, 2, 4, 8, 9, 10] 1 x [1, 2, 9, 9, 10] 5 x [2, 3, 6, 8, 9, 10] 1 x [2, 3, 8, 9, 10, 10] 1 x [1, 1, 3, 5, 6, 7]