Build (method = -2) #dp: 1074 Step-3' Graph: 65 vertices and 188 arcs (0.00s) Step-4' Graph: 26 vertices and 110 arcs (0.00s) #V4/#V3 = 0.40 #A4/#A3 = 0.59 Ready! (0.00s) Optimize a model with 35 rows, 111 columns and 287 nonzeros Presolve removed 11 rows and 21 columns Presolve time: 0.00s Presolved: 24 rows, 90 columns, 248 nonzeros Variable types: 0 continuous, 90 integer (0 binary) Found heuristic solution: objective 96.0000000 Found heuristic solution: objective 47.0000000 Optimize a model with 24 rows, 90 columns and 248 nonzeros Presolved: 24 rows, 90 columns, 248 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.090e+02 Factor NZ : 2.360e+02 Factor Ops : 2.788e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.48486743e+02 -1.39409134e+03 5.46e+02 2.22e-16 3.95e+01 0s 1 1.43260058e+02 -5.62895757e+02 4.06e+01 6.66e-16 5.38e+00 0s 2 6.51215256e+01 -1.05517099e+02 3.36e-02 5.55e-16 9.06e-01 0s 3 2.62662184e+01 -9.82808148e+00 3.27e-03 5.00e-16 1.91e-01 0s 4 1.81462017e+01 1.24637803e+01 5.08e-04 3.05e-16 3.01e-02 0s 5 1.68298857e+01 1.62650583e+01 1.11e-05 4.44e-16 2.99e-03 0s 6 1.66667976e+01 1.66659728e+01 1.84e-08 4.44e-16 4.36e-06 0s 7 1.66666667e+01 1.66666667e+01 3.14e-14 3.33e-16 4.45e-12 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 1.66666667e+01 Root relaxation: objective 1.666667e+01, 61 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 8 47.00000 16.66667 64.5% - 0s H 0 0 17.0000000 16.66667 1.96% - 0s Explored 0 nodes (66 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.01 seconds Objective: 17 Solution: 3 x [1, 2, 5, 6, 7, 9] 7 x [1, 2, 2, 4, 8, 8] 4 x [1, 3, 4, 5, 7, 7] 1 x [1, 2, 4, 7] 2 x [2, 4, 6, 7, 8, 8]