Strong linear programming relaxations for the orienteering problem

DOI10.1016/0377-2217(94)90247-XMaRDI QIDQ1328645zbMATH OpenOpenAlexFDO

Authors 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

NP-hardrelaxationroutingupper boundsorienteering problem0-1 integer program

Mathematics Subject Classification ID

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

Recommendations

• Solving the Orienteering Problem through Branch-and-Cut
• An Optimal Algorithm for the Orienteering Tour Problem
• The orienteering problem: a survey
• Solving relaxation orienteering problem using DCA-CUT
• The team orienteering problem: formulations and branch-cut and price

Cites work

• scientific article; zbMATH DE number 4061010 (Why is no real title available?)
• scientific article; zbMATH DE number 4125195 (Why is no real title available?)
• A Modeling Language for Mathematical Programming
• A new polynomial-time algorithm for linear programming
• Algorithms to solve the orienteering problem: A comparison
• Finding All the Elementary Circuits of a Directed Graph
• The orienteering problem
• The selective travelling salesman problem

Cited in

(19)

• Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem
• The orienteering problem: a survey
• Minimum directed 1-subtree relaxation for score orienteering problem
• A branch-and-cut algorithm for the capacitated profitable tour problem
• Hybrid genetic algorithm for undirected traveling salesman problems with profits
• A revisited branch-and-cut algorithm for large-scale orienteering problems
• A fast and effective heuristic for the orienteering problem
• Routing problems: A bibliography
• Using artificial neural networks to solve the orienteering problem
• Solving relaxation orienteering problem using DCA-CUT
• A two-stage vehicle routing model for large-scale bioterrorism emergencies
• A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
• Mixed-integer programming approaches for the time-constrained maximal covering routing problem
• Coupling ant colony systems with strong local searches
• A stabilized column generation scheme for the traveling salesman subtour problem
• Efficient meta-heuristics for the multi-objective time-dependent orienteering problem
• An effective PSO-inspired algorithm for the team orienteering problem
• UAV routing for reconnaissance mission: a multi-objective orienteering problem with time-dependent prizes and multiple connections
• A TSSP+1 decomposition strategy for the vehicle routing problem

Describes a project that uses

Uses Software

• VRP

This page was built for publication: Strong linear programming relaxations for the orienteering problem

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