The symmetric clustered traveling salesman problem
- 13 January 1985
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 19 (1) , 68-75
- https://doi.org/10.1016/0377-2217(85)90309-1
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Nonoptimal Edges for the Symmetric Traveling Salesman ProblemOperations Research, 1984
- The symmetric traveling salesman problem and edge exchanges in minimal 1-treesEuropean Journal of Operational Research, 1983
- A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxationEuropean Journal of Operational Research, 1982
- Procedures for travelling salesman problems with additional constraintsEuropean Journal of Operational Research, 1979
- The clustered traveling salesman problemComputers & Operations Research, 1975
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- The Traveling-Salesman Problem and Minimum Spanning TreesOperations Research, 1970
- An Algorithm for the Traveling Salesman ProblemOperations Research, 1963