The capacitated orienteering problem
From MaRDI portal
Publication:496434
DOI10.1016/j.dam.2014.10.001zbMath1320.05065OpenAlexW2027505077MaRDI QIDQ496434
Publication date: 21 September 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.10.001
Extremal problems in graph theory (05C35) Combinatorial optimization (90C27) Paths and cycles (05C38) Approximation algorithms (68W25)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- New approaches to multi-objective optimization
- The orienteering problem: a survey
- The team orienteering problem
- A heuristic for the multiple tour maximum collection problem
- A TABU search heuristic for the team orienteering problem
- Complexity and approximation for traveling salesman problems with profits
- An exact algorithm for team orienteering problems
- The split delivery capacitated team orienteering problem
- Approximation algorithms for distance constrained vehicle routing problems
- The capacitated team orienteering and profitable tour problems
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Approximation algorithms for deadline-TSP and vehicle routing with time-windows
- The Euclidean Orienteering Problem Revisited
- The orienteering problem
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
- Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
- Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing
- Approximation Algorithms for Orienteering and Discounted-Reward TSP
This page was built for publication: The capacitated orienteering problem
