Approximation algorithms for a vehicle routing problem
DOI10.1007/S00186-008-0224-YzbMATH Open1279.90017OpenAlexW2086375152MaRDI QIDQ953301FDOQ953301
Sleman Saliba, T. Vredeveld, Stephan Westphal, Sven O. Krumke
Publication date: 17 November 2008
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-008-0224-y
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Transportation, logistics and supply chain management (90B06)
Cites Work
Cited In (12)
- Approximation algorithms for some extensions of the maximum profit routing problem
- An approximation algorithm for vehicle routing with compatibility constraints
- Approximation Algorithms for Conflict-Free Vehicle Routing
- The EMS vehicle patient transportation problem during a demand surge
- Title not available (Why is that?)
- Vehicle Routing Algorithms for Radially Escaping Targets
- The \(k\)-dissimilar vehicle routing problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximations for minimum and min-max vehicle routing problems
- Improving the approximation ratio for capacitated vehicle routing
- Variants and formulations of the vehicle routing problem
This page was built for publication: Approximation algorithms for a vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953301)