Build (method = -2) #dp: 1238 Step-3' Graph: 87 vertices and 303 arcs (0.01s) Step-4' Graph: 39 vertices and 207 arcs (0.01s) #V4/#V3 = 0.45 #A4/#A3 = 0.68 Ready! (0.01s) Optimize a model with 49 rows, 208 columns and 555 nonzeros Presolve removed 6 rows and 9 columns Presolve time: 0.00s Presolved: 43 rows, 199 columns, 543 nonzeros Variable types: 0 continuous, 199 integer (24 binary) Found heuristic solution: objective 83.0000000 Optimize a model with 43 rows, 199 columns and 543 nonzeros Presolved: 43 rows, 199 columns, 543 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 2.820e+02 Factor NZ : 6.660e+02 Factor Ops : 1.220e+04 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 6.14384389e+02 -2.54680385e+03 1.56e+03 7.25e-02 3.56e+01 0s 1 1.70724141e+02 -1.11883976e+03 2.20e+02 6.66e-16 6.19e+00 0s 2 7.87970952e+01 -2.34697441e+02 1.68e+01 5.00e-16 9.02e-01 0s 3 4.29168123e+01 -3.65225657e+01 1.69e+00 2.64e-16 2.03e-01 0s 4 1.93910251e+01 -8.68390535e+00 4.44e-01 1.67e-16 7.05e-02 0s 5 1.92392053e+01 5.63064069e+00 3.43e-01 2.82e-16 3.42e-02 0s 6 1.71379754e+01 1.51336964e+01 9.22e-03 1.63e-16 4.93e-03 0s 7 1.66674896e+01 1.66620541e+01 2.05e-05 2.22e-16 1.34e-05 0s 8 1.66666675e+01 1.66666621e+01 9.43e-15 2.95e-16 1.34e-08 0s 9 1.66666667e+01 1.66666667e+01 1.61e-14 2.73e-16 1.35e-14 0s Barrier solved model in 9 iterations and 0.00 seconds Optimal objective 1.66666667e+01 Root relaxation: objective 1.666667e+01, 131 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 10 83.00000 16.66667 79.9% - 0s H 0 0 17.0000000 16.66667 1.96% - 0s Explored 0 nodes (205 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: 3 x [1, 2, 3, 8, 9, 10] 1 x [1, 4, 7, 8, 10] 1 x [1, 3, 5, 7, 9] 7 x [1, 2, 3, 4, 8, 9] 3 x [3, 4, 6, 6, 6, 8] 2 x [4, 6, 6, 7, 7, 8]