New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints
Authors:
- 1 January 2005
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 33 (1) , 62-70
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Compact vs. exponential-size LP relaxationsOperations Research Letters, 2002
- The asymmetric travelling salesman problem: on generalizations of disaggregated Miller–Tucker–Zemlin constraintsDiscrete Applied Mathematics, 2001
- A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence ConstraintsComputational Optimization and Applications, 2000
- The asymmetric travelling salesman problem and a reformulation of the Miller–Tucker–Zemlin constraintsEuropean Journal of Operational Research, 1999
- The precedence-constrained asymmetric traveling salesman polytopeMathematical Programming, 1995
- A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationshipsAnnals of Operations Research, 1994
- An analytical comparison of different formulations of the travelling salesman problemMathematical Programming, 1991
- Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraintsOperations Research Letters, 1991
- Integer Programming Formulation of Traveling Salesman ProblemsJournal of the ACM, 1960
- Solution of a Large-Scale Traveling-Salesman ProblemJournal of the Operations Research Society of America, 1954