Generalized travelling salesman problem through n sets of nodes: the asymmetrical case
- 30 November 1987
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 18 (2) , 185-197
- https://doi.org/10.1016/0166-218x(87)90020-5
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Optimal tour planning with specified nodesRairo-Operations Research, 1984
- Complexity of vehicle routing and scheduling problemsNetworks, 1981
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman ProblemManagement Science, 1980
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973
- Technical Note—Bounds for the Travelling-Salesman ProblemOperations Research, 1972