A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets

A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints

Computational Optimization and Applications

On the Separation of Maximally Violated mod-k Cuts

Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization

The m-Cost ATSP

Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization

Solving real-world ATSP instances by branch-and-cut

Combinatorial optimization - Eureka, you shrink!

A Branch-and-Cut Algorithm for the Median-Path Problem

Computational Optimization and Applications

Optimizing over the first chvàtal closure

IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization

Survey of facial results for the traveling salesman polytope

Mathematical and Computer Modelling: An International Journal

New facets of the STS polytope generated from known facets of the ATS polytope

Discrete Optimization

Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs

Discrete Optimization

Three Ideas for the Quadratic Assignment Problem

Operations Research