Strong linear programming relaxations for the orienteering problem
- 24 March 1994
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 73 (3), 517-523
- https://doi.org/10.1016/0377-2217(94)90247-x
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A Modeling Language for Mathematical ProgrammingManagement Science, 1990
- The selective travelling salesman problemDiscrete Applied Mathematics, 1990
- Algorithms to solve the orienteering problem: A comparisonEuropean Journal of Operational Research, 1989
- A multifaceted heuristic for the orienteering problemNaval Research Logistics (NRL), 1988
- The orienteering problemNaval Research Logistics (NRL), 1987
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- Heuristic Methods Applied to OrienteeringJournal of the Operational Research Society, 1984
- Finding All the Elementary Circuits of a Directed GraphSIAM Journal on Computing, 1975