Recommendations
- Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems
- Improved algorithms for orienteering and related problems
- Asymmetric traveling salesman path and directed latency problems
- Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs
- Approximation algorithms for the directed k-tour and k-stroll problems
Cites work
- A characterization of the minimum cycle mean in a digraph
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- An \(O(\log n/ \log \log n)\)-approximation algorithm for the asymmetric traveling salesman problem
- Approximation algorithms for deadline-TSP and vehicle routing with time-windows
- Approximation Algorithms for Orienteering and Discounted-Reward TSP
- Approximation algorithms for the directed k-tour and k-stroll problems
- Bounds and Heuristics for Capacitated Routing Problems
- scientific article; zbMATH DE number 5764858 (Why is no real title available?)
- scientific article; zbMATH DE number 4103110 (Why is no real title available?)
- scientific article; zbMATH DE number 1305546 (Why is no real title available?)
- scientific article; zbMATH DE number 1416629 (Why is no real title available?)
- Konstruktion aller n-fach kantenzusammenhaengenden Digraphen
- On the Distance Constrained Vehicle Routing Problem
- On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
- Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems
- Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs
- Survivable networks, linear programming relaxations and the parsimonious property
- The General Pickup and Delivery Problem
- The orienteering problem
- The Orienteering Problem with Time Windows
- The Traveling-Salesman Problem and Minimum Spanning Trees
- Vehicle Routing with Time Windows
Cited in
(20)- The team orienteering problem
- Discounted reward TSP
- The set orienteering problem
- The distance orientation problem
- An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem
- Approximation algorithms for the directed \(k\)-Tour and \(k\)-Stroll problems
- Improved algorithms for orienteering and related problems
- Approximation algorithms for the directed k-tour and k-stroll problems
- Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems
- Approximation algorithms for the arc orienteering problem
- The capacitated orienteering problem
- Quasi-polynomial algorithms for submodular tree orienteering and directed network design problems
- Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
- Approximation Algorithms for Orienteering and Discounted-Reward TSP
- Orienteering with one endomorphism
- The hazardous orienteering problem
- Vehicle routing with time-dependent travel times: theory, practice, and benchmarks
- A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme
- Constant-factor approximation to deadline TSP and related problems in (almost) quasi-polytime
- Approximation schemes for orienteering and deadline TSP in doubling metrics
This page was built for publication: The directed orienteering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q547309)
