An algorithm for the traveling salesman problem with pickup and delivery customers
- 31 December 1985
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 22 (3) , 377-386
- https://doi.org/10.1016/0377-2217(85)90257-7
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman ProblemOperations Research, 1983
- A restricted Lagrangean approach to the traveling salesman problemMathematical Programming, 1981
- Travelling Salesman and Assignment Problems: A SurveyAnnals of Discrete Mathematics, 1979
- Note—A Note on “The Formulation of the M-Salesman Traveling Salesman Problem”Management Science, 1976
- Transformation of Multisalesman Problem to the Standard Traveling Salesman ProblemJournal of the ACM, 1974
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- Pathology of Traveling-Salesman Subtour-Elimination AlgorithmsOperations Research, 1971
- The Traveling-Salesman Problem and Minimum Spanning TreesOperations Research, 1970
- The Traveling Salesman Problem: A SurveyOperations Research, 1968
- Scheduling of Vehicles from a Central Depot to a Number of Delivery PointsOperations Research, 1964