The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
- 1 August 2009
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 196 (3), 987-995
- https://doi.org/10.1016/j.ejor.2008.05.009
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- The dial-a-ride problem: models and algorithmsAnnals of Operations Research, 2007
- Static pickup and delivery problems: a classification scheme and surveyTOP, 2007
- On extended formulations for the precedence constrained asymmetric traveling salesman problemNetworks, 2006
- A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence ConstraintsComputational Optimization and Applications, 2000
- Exact solution of multicommodity network optimization problems with general step cost functionsOperations Research Letters, 1999
- Routing a vehicle of capacity greater than oneDiscrete Applied Mathematics, 1998
- Network Design Using Cut InequalitiesSIAM Journal on Optimization, 1996
- The precedence-constrained asymmetric traveling salesman polytopeMathematical Programming, 1995
- The swapping problemNetworks, 1992
- Approximation Algorithms for Some Routing ProblemsSIAM Journal on Computing, 1978