Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems

DOI10.1007/978-3-540-74208-1_19MaRDI QIDQ3603470zbMATH OpenOpenAlexFDO

Authors Viswanath Nagarajan, R. Ravi

Publication date 17 February 2009

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL https://figshare.com/articles/journal_contribution/Poly-logarithmic_Approximation_Algorithms_for_Directed_Vehicle_Routing_Problems/6707405

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Recommendations

• The directed orienteering problem
• Improved algorithms for orienteering and related problems
• Approximation algorithms for deadline-TSP and vehicle routing with time-windows
• Asymmetric traveling salesman path and directed latency problems
• Approximation algorithms for the directed \(k\)-tour and \(k\)-stroll problems

Cited in

(7)

• Approximation algorithms for the traveling repairman and speeding deliveryman problems
• Approximation algorithms for the directed \(k\)-tour and \(k\)-stroll problems
• The Directed Minimum Latency Problem
• scientific article; zbMATH DE number 5863215 (Why is no real title available?)
• The directed orienteering problem
• Approximation algorithms for the directed \(k\)-Tour and \(k\)-Stroll problems
• Approximation algorithms for deadline-TSP and vehicle routing with time-windows

This page was built for publication: Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603470)