Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints
- 1 February 1991
- journal article
- Published by Elsevier BV in Operations Research Letters
- Vol. 10 (1), 27-36
- https://doi.org/10.1016/0167-6377(91)90083-2
Abstract
This paper shows how the subtour elimination constraints developed by Miller, Tucker and Zemlin for the traveling salesman problem can be improved and extended to various types of vehicle routing problems.Keywords
This publication has 8 references indexed in Scilit:
- Classification of travelling salesman problem formulationsOperations Research Letters, 1990
- Optimal Routing under Capacity and Distance RestrictionsOperations Research, 1985
- Integer programming formulations of vehicle routing problemsEuropean Journal of Operational Research, 1985
- Partial linear characterizations of the asymmetric travelling salesman polytopeMathematical Programming, 1975
- Faces for a linear inequality in 0–1 variablesMathematical Programming, 1975
- On the facial structure of set packing polyhedraMathematical Programming, 1973
- 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