A proven approach for solving hard combinatorial optimization problems is via polyhedral methods applied to integer programming formulations. Efficient algorithms for such problems are often problem specific and exploit ...