The selective travelling salesman problem
- 31 March 1990
- journal article
- Published by Elsevier BV in Discrete Applied Mathematics
- Vol. 26 (2-3), 193-207
- https://doi.org/10.1016/0166-218x(90)90100-q
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- A multifaceted heuristic for the orienteering problemNaval Research Logistics (NRL), 1988
- The orienteering problemNaval Research Logistics (NRL), 1987
- Generalized Subtour Elimination Constraints and Connectivity ConstraintsJournal of the Operational Research Society, 1986
- Heuristic Methods Applied to OrienteeringJournal of the Operational Research Society, 1984
- Dynamic Programming in Orienteering: Route Choice and the Siting of ControlsJournal of the Operational Research Society, 1984
- An Analysis of Several Heuristics for the Traveling Salesman ProblemSIAM Journal on Computing, 1977
- An upper bound for the zero-one knapsack problem and a branch and bound algorithmEuropean Journal of Operational Research, 1977