Build (method = -2) #dp: 826 Step-3' Graph: 60 vertices and 169 arcs (0.00s) Step-4' Graph: 16 vertices and 81 arcs (0.01s) #V4/#V3 = 0.27 #A4/#A3 = 0.48 Ready! (0.01s) Optimize a model with 26 rows, 82 columns and 222 nonzeros Presolve removed 6 rows and 10 columns Presolve time: 0.00s Presolved: 20 rows, 72 columns, 204 nonzeros Variable types: 0 continuous, 72 integer (0 binary) Found heuristic solution: objective 99.0000000 Found heuristic solution: objective 56.0000000 Optimize a model with 20 rows, 72 columns and 204 nonzeros Presolved: 20 rows, 72 columns, 204 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 8.300e+01 Factor NZ : 2.100e+02 Factor Ops : 2.870e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.85581408e+02 -5.64975562e+02 1.49e+02 1.11e-16 1.75e+01 0s 1 6.96335239e+01 -2.41349867e+02 3.58e+00 5.55e-16 2.27e+00 0s 2 4.04799249e+01 -3.99284294e+01 3.39e-02 2.22e-16 5.28e-01 0s 3 2.11712862e+01 1.27569796e+01 1.37e-03 3.05e-16 5.46e-02 0s 4 2.01145037e+01 1.97727001e+01 1.55e-04 2.22e-16 2.22e-03 0s 5 2.00001081e+01 1.99995602e+01 5.95e-15 1.11e-16 3.56e-06 0s 6 2.00000000e+01 2.00000000e+01 6.94e-15 1.11e-16 3.62e-12 0s Barrier solved model in 6 iterations and 0.00 seconds Optimal objective 2.00000000e+01 Root relaxation: objective 2.000000e+01, 57 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 20.0000000 20.00000 0.0% - 0s Explored 0 nodes (57 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.000000000000e+01, best bound 2.000000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.02 seconds Objective: 20 Solution: 2 x [3, 4, 5, 8, 9] 2 x [1, 2, 4, 5, 9] 4 x [1, 3, 6, 7, 7] 11 x [3, 5, 7, 8, 10] 1 x [3, 7, 7, 8, 10]