An efficient composite heuristic for the symmetric generalized traveling salesman problem
Authors:
- 1 August 1998
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 108 (3) , 571-584
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- An efficient four-phase heuristic for the generalized orienteering problemComputers & Operations Research, 1991
- The prize collecting traveling salesman problemNetworks, 1989
- Algorithms to solve the orienteering problem: A comparisonEuropean Journal of Operational Research, 1989
- On Some Generalizations of the Travelling-Salesman ProblemJournal of the Operational Research Society, 1987
- The symmetric clustered traveling salesman problemEuropean Journal of Operational Research, 1985
- Heuristic Methods Applied to OrienteeringJournal of the Operational Research Society, 1984
- The design and analysis of heuristicsNetworks, 1981
- Two generalizations of the traveling salesman problemOmega, 1981
- An Industrial application of the traveling salesman's subtour problemA I I E Transactions, 1978
- The clustered traveling salesman problemComputers & Operations Research, 1975