The directed orienteering problem

DOI10.1007/s00453-011-9509-2zbMath1279.90177OpenAlexW1967197960MaRDI QIDQ547309

R. Ravi, Viswanath Nagarajan

Publication date: 1 July 2011

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-011-9509-2

zbMATH Keywords

TSPvehicle routingdirected graphsapproximation algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems ⋮ Discounted reward TSP ⋮ Approximation algorithms for the arc orienteering problem ⋮ An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem ⋮ Running Errands in Time: Approximation Algorithms for Stochastic Orienteering

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Survivable networks, linear programming relaxations and the parsimonious property
• Konstruktion aller n-fach kantenzusammenhaengenden Digraphen
• A characterization of the minimum cycle mean in a digraph
• Approximation algorithms for deadline-TSP and vehicle routing with time-windows
• Approximation Algorithms for the Directed k-Tour and k-Stroll Problems
• Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems
• Bounds and Heuristics for Capacitated Routing Problems
• Vehicle Routing with Time Windows
• The orienteering problem
• Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs
• On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• The Orienteering Problem with Time Windows
• On the Distance Constrained Vehicle Routing Problem
• The General Pickup and Delivery Problem
• Approximation Algorithms for Orienteering and Discounted-Reward TSP
• The Traveling-Salesman Problem and Minimum Spanning Trees

This page was built for publication: The directed orienteering problem