Strong linear programming relaxations for the orienteering problem

DOI10.1016/0377-2217(94)90247-XzbMath0807.90087OpenAlexW2095032305MaRDI QIDQ1328645

Adrienne C. Leifer, Moshe B. Rosenwein

Publication date: 1 March 1995

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90247-x

zbMATH Keywords

upper boundsrelaxationNP-hardroutingorienteering problem0-1 integer program

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Transportation, logistics and supply chain management (90B06)

Related Items

A TSSP+1 decomposition strategy for the vehicle routing problem, UAV routing for reconnaissance mission: a multi-objective orienteering problem with time-dependent prizes and multiple connections, Efficient meta-heuristics for the multi-objective time-dependent orienteering problem, 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, Coupling ant colony systems with strong local searches, The orienteering problem: a survey, A revisited branch-and-cut algorithm for large-scale orienteering problems, Hybrid genetic algorithm for undirected traveling salesman problems with profits, A stabilized column generation scheme for the traveling salesman subtour problem, Mixed-integer programming approaches for the time-constrained maximal covering routing problem, A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem, A two-stage vehicle routing model for large-scale bioterrorism emergencies, A fast and effective heuristic for the orienteering problem, Minimum directed 1-subtree relaxation for score orienteering problem, A branch-and-cut algorithm for the capacitated profitable tour problem, An effective PSO-inspired algorithm for the team orienteering problem

Uses Software

• VRP

Cites Work

• A Modeling Language for Mathematical Programming
• A new polynomial-time algorithm for linear programming
• The selective travelling salesman problem
• Algorithms to solve the orienteering problem: A comparison
• The orienteering problem
• Finding All the Elementary Circuits of a Directed Graph
• Unnamed Item
• Unnamed Item