A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
- 30 December 2004
- journal article
- Published by Elsevier BV in Discrete Applied Mathematics
- Vol. 145 (1), 126-139
- https://doi.org/10.1016/j.dam.2003.09.013
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- 3. Branch-And-Cut Algorithms for the Capacitated VRPPublished by Society for Industrial & Applied Mathematics (SIAM) ,2002
- Heuristics for the traveling salesman problem with pickup and deliveryComputers & Operations Research, 1999
- The Travelling Salesman Problem with pick-up and deliveryEuropean Journal of Operational Research, 1994
- The traveling salesman problem with delivery and backhaulsOperations Research Letters, 1994
- The swapping problemNetworks, 1992
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman ProblemsSIAM Review, 1991
- Chapter IV Network flowsPublished by Elsevier BV ,1989
- Set Partitioning: A surveyPublished by Society for Industrial & Applied Mathematics (SIAM) ,1976
- Set PartitioningPublished by Springer Science and Business Media LLC ,1975
- Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 1962