An Optimal Algorithm for the Orienteering Tour Problem
From MaRDI portal
Publication:4030787
DOI10.1287/ijoc.4.2.155zbMath0782.90093OpenAlexW2154072282MaRDI QIDQ4030787
No author found.
Publication date: 1 April 1993
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.4.2.155
production schedulingvehicle routingLagrangean relaxationtraveling salesmanNP-hardorienteeringdegree-constrained spanning tree procedure
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
The clustered orienteering problem, A guided local search metaheuristic for the team orienteering problem, Heuristic algorithms for visiting the customers in a rolling schedule environment, A two-stage approach to the orienteering problem with stochastic weights, Managing platelet supply through improved routing of blood collection vehicles, Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem, Using artificial neural networks to solve the orienteering problem, Routing problems: A bibliography, Evolution-inspired local improvement algorithm solving orienteering problem, The orienteering problem: a survey, A revisited branch-and-cut algorithm for large-scale orienteering problems, A stabilized column generation scheme for the traveling salesman subtour problem, Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming, A TABU search heuristic for the team orienteering problem, A path relinking approach for the team orienteering problem, A note on relatives to the Held and Karp 1-tree problem, A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times, Locating a cycle in a transportation or a telecommunications network, A two-stage vehicle routing model for large-scale bioterrorism emergencies, A Tabu search algorithm for the probabilistic orienteering problem, A fast and effective heuristic for the orienteering problem, Minimum directed 1-subtree relaxation for score orienteering problem, An efficient composite heuristic for the symmetric generalized traveling salesman problem, The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm, A heuristic for the multiple tour maximum collection problem, A tabu search heuristic for the undirected selective travelling salesman problem
