Build (method = -2) #dp: 154 Step-3' Graph: 30 vertices and 83 arcs (0.00s) Step-4' Graph: 26 vertices and 75 arcs (0.00s) #V4/#V3 = 0.87 #A4/#A3 = 0.90 Ready! (0.00s) Optimize a model with 36 rows, 76 columns and 180 nonzeros Presolve removed 11 rows and 19 columns Presolve time: 0.00s Presolved: 25 rows, 57 columns, 157 nonzeros Variable types: 0 continuous, 57 integer (0 binary) Optimize a model with 25 rows, 57 columns and 157 nonzeros Presolved: 25 rows, 57 columns, 157 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.090e+02 Factor NZ : 2.650e+02 Factor Ops : 3.425e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 4.82469078e+01 -1.39223416e+02 1.21e+02 2.22e-16 6.20e+00 0s 1 2.64736794e+01 -5.21543103e+01 1.12e+01 8.38e-03 9.80e-01 0s 2 1.80054035e+01 2.02933410e+00 1.45e+00 3.42e-04 1.64e-01 0s 3 1.70165085e+01 1.61332351e+01 6.10e-02 3.61e-16 8.58e-03 0s 4 1.70041095e+01 1.69959961e+01 6.42e-13 2.22e-16 7.51e-05 0s 5 1.70000000e+01 1.70000000e+01 1.57e-11 2.19e-16 3.11e-10 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 1.70000000e+01 Root relaxation: objective 1.700000e+01, 33 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 17.0000000 17.00000 0.0% - 0s Explored 0 nodes (33 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: 4 x [1, 3, 4, 5, 7, 8, 9] 1 x [1, 3, 5, 7] 1 x [1, 3, 5, 7, 8, 9, 10] 1 x [1, 3, 5, 7, 9, 10] 4 x [1, 4, 5, 6, 7, 8, 9] 2 x [1, 5, 7] 1 x [1, 5, 10] 3 x [2, 3, 5, 7, 8, 9]