Strong linear programming relaxations for the orienteering problem
From MaRDI portal
Publication:1328645
DOI10.1016/0377-2217(94)90247-XzbMATH Open0807.90087OpenAlexW2095032305MaRDI QIDQ1328645FDOQ1328645
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
Recommendations
Linear programming (90C05) Integer programming (90C10) Transportation, logistics and supply chain management (90B06)
Cites Work
- A Modeling Language for Mathematical Programming
- A new polynomial-time algorithm for linear programming
- The orienteering problem
- Algorithms to solve the orienteering problem: A comparison
- Title not available (Why is that?)
- The selective travelling salesman problem
- Title not available (Why is that?)
- Finding All the Elementary Circuits of a Directed Graph
Cited In (19)
- A two-stage vehicle routing model for large-scale bioterrorism emergencies
- The orienteering problem: a survey
- 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
- Solving relaxation orienteering problem using DCA-CUT
- Minimum directed 1-subtree relaxation for score orienteering problem
- UAV routing for reconnaissance mission: a multi-objective orienteering problem with time-dependent prizes and multiple connections
- A branch-and-cut algorithm for the capacitated profitable tour problem
- Efficient meta-heuristics for the multi-objective time-dependent orienteering problem
- A fast and effective heuristic for the orienteering problem
- Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem
- A stabilized column generation scheme for the traveling salesman subtour problem
- A revisited branch-and-cut algorithm for large-scale orienteering problems
- Routing problems: A bibliography
- Using artificial neural networks to solve the orienteering problem
- Coupling ant colony systems with strong local searches
- An effective PSO-inspired algorithm for the team orienteering problem
- A TSSP+1 decomposition strategy for the vehicle routing problem
- Hybrid genetic algorithm for undirected traveling salesman problems with profits
Uses Software
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)
