Improved algorithms for orienteering and related problems
From MaRDI portal
Recommendations
Cited in
(42)- A fast and effective heuristic for the orienteering problem
- Maximum coverage problem with group budget constraints
- Discounted reward TSP
- Approximation algorithms for time-dependent orienteering.
- Faster algorithms for orienteering and \(k\)-TSP
- Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems
- An approximation algorithm for vehicle routing with compatibility constraints
- Orienteering for electioneering
- Complexity and approximation for traveling salesman problems with profits
- Orienteering problem with time-windows and updating delay
- Capacitated vehicle routing with nonuniform speeds
- Dynamic traveling repair problem with an arbitrary time window
- Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems
- The Euclidean Orienteering Problem Revisited
- Approximation algorithms for the arc orienteering problem
- scientific article; zbMATH DE number 1839476 (Why is no real title available?)
- The capacitated orienteering problem
- Quasi-polynomial algorithms for submodular tree orienteering and directed network design problems
- Prize-collecting TSP with a budget constraint
- Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
- Approximation algorithms for stochastic k-TSP
- Minisum and maximin aerial surveillance over disjoint rectangles
- Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
- Approximation Algorithms for Orienteering and Discounted-Reward TSP
- The directed orienteering problem
- New approximation algorithms for the rooted budgeted cycle cover problem
- Deadline TSP
- New approximation algorithms for the rooted budgeted cycle cover problem
- An improved approximation guarantee for prize-collecting TSP
- Vehicle routing with time-dependent travel times: theory, practice, and benchmarks
- Simple heuristics for the rooted max tree coverage problem
- Approximation algorithm for generalized budgeted assignment problems and applications in transportation systems
- Algorithms for the thief orienteering problem on directed acyclic graphs
- Approximation algorithms for graph search problems with imperfect detection
- Approximation algorithms for correlated knapsack orienteering
- A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme
- Designing a sports orienteering contest: physical versus cognitive skills in rogaining
- A better-than-1.6-approximation for prize-collecting TSP
- A better-than-1.6-approximation for prize-collecting TSP
- Constant-factor approximation to deadline TSP and related problems in (almost) quasi-polytime
- Approximation schemes for orienteering and deadline TSP in doubling metrics
- On the adaptivity gap of stochastic orienteering
This page was built for publication: Improved algorithms for orienteering and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189064)
