A note on the lifted Miller–Tucker–Zemlin subtour elimination constraints for the capacitated vehicle routing problem
- 1 November 2004
- journal article
- research article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 158 (3), 793-795
- https://doi.org/10.1016/s0377-2217(03)00377-1
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Models, relaxations and exact approaches for the capacitated vehicle routing problemDiscrete Applied Mathematics, 2002
- Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraintsOperations Research Letters, 1991
- Integer programming formulations of vehicle routing problemsEuropean Journal of Operational Research, 1985
- Integer Programming Formulation of Traveling Salesman ProblemsJournal of the ACM, 1960