An Optimal Algorithm for the Orienteering Tour Problem

DOI10.1287/IJOC.4.2.155MaRDI QIDQ4030787zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

degree-constrained spanning tree procedureLagrangean relaxationNP-hardorienteeringproduction schedulingtraveling salesmanvehicle routing

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Transportation, logistics and supply chain management (90B06) Programming involving graphs or networks (90C35)

Recommendations

• The orienteering problem: a survey
• The orienteering problem
• A fast and effective heuristic for the orienteering problem
• Solving the Orienteering Problem through Branch-and-Cut
• scientific article; zbMATH DE number 4061010

Cited in

(37)

• 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
• A heuristic for the multiple tour maximum collection problem
• Strong linear programming relaxations for the orienteering problem
• The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm
• A tabu search heuristic for the undirected selective travelling salesman problem
• Managing platelet supply through improved routing of blood collection vehicles
• A comparison of algorithms for finding an efficient theme park tour
• A TABU search heuristic for the team orienteering problem
• Using artificial neural networks to solve the orienteering problem
• Routing problems: A bibliography
• A tabu search algorithm for the probabilistic orienteering problem
• Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem
• A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times
• A guided local search metaheuristic for the team orienteering problem
• Evolution-inspired local improvement algorithm solving orienteering problem
• A stabilized column generation scheme for the traveling salesman subtour problem
• A note on relatives to the Held and Karp 1-tree problem
• The orienteering problem with time windows applied to robotic melon harvesting
• Splitting a giant tour using integer linear programming
• The clustered orienteering problem
• A two-stage vehicle routing model for large-scale bioterrorism emergencies
• A two-stage approach to the orienteering problem with stochastic weights
• Locating a cycle in a transportation or a telecommunications network
• The orienteering problem
• scientific article; zbMATH DE number 4061010 (Why is no real title available?)
• scientific article; zbMATH DE number 1839476 (Why is no real title available?)
• Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
• Solving relaxation orienteering problem using DCA-CUT
• scientific article; zbMATH DE number 7053373 (Why is no real title available?)
• A revisited branch-and-cut algorithm for large-scale orienteering problems
• The orienteering problem: a survey
• Low budget traveling: the orienteering problem with hotel selection and budget constraint
• Heuristic algorithms for visiting the customers in a rolling schedule environment
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
• A path relinking approach for the team orienteering problem

This page was built for publication: An Optimal Algorithm for the Orienteering Tour Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4030787)