Multiple description video multicast in wireless ad hoc networks
Mobile Networks and Applications - Special issue: Recent advances in wireless networking
Invited review: A comparative analysis of several asymmetric traveling salesman problem formulations
Computers and Operations Research
Computers and Operations Research
Color-Coding Algorithms to the Balanced Path Problem: Computational Issues
INFORMS Journal on Computing
The Traveling Salesman Problem with Draft Limits
Computers and Operations Research
A bilevel programming approach to the travelling salesman problem
Operations Research Letters
Tight compact models and comparative analysis for the prize collecting Steiner tree problem
Discrete Applied Mathematics
Natural and extended formulations for the Time-Dependent Traveling Salesman Problem
Discrete Applied Mathematics
The Steiner Tree Problem with Delays: A compact formulation and reduction procedures
Discrete Applied Mathematics
| Hi-index | 0.01 |
This paper is concerned with applying theReformulation-Linearization Technique (RLT) to derive tighter relaxations for theAsymmetric Traveling Salesman Problem (ATSP) formulation that is based on theMiller-Tucker-Zemlin (MTZ) subtour elimination constraints. The MTZ constraints yield a compact representation for the Traveling Salesman Problem (TSP), and their use is particularly attractive in various routing and scheduling contexts that have an embedded ATSP structure. However, it is well recognized that these constraints yield weak relaxations, and with this motivation, Desrochers and Laporte (1991) have lifted the MTZ constraints into facets of the underlying ATSP polytope. We show that a novel application of the RLT process from a nonstandard MTZ representation of the ATSP reveals a new formulation of this problem that is compact, and yet theoretically as well as computationally dominates the lifted-MTZ formulation of Desrochers and Laporte. This approach is also extended to derive tight formulations for thePrecedence Constrained Asymmetric Traveling Salesman Problem (PCATSP), based on the MTZ subtour elimination constraints. Additional classes of valid inequalities are also developed for both these versions of the ATSP, and further ideas for developing tighter representations are suggested for future investigations.