Approximation algorithms for a vehicle routing problem

DOI10.1007/s00186-008-0224-yzbMath1279.90017OpenAlexW2086375152MaRDI QIDQ953301

Sleman Saliba, Tjark 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

zbMATH Keywords

vehicle routingNP-completenessapproximation algorithms

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

The EMS vehicle patient transportation problem during a demand surge

Cites Work

• Unnamed Item
• Unnamed Item
• Bounds and Heuristics for Capacitated Routing Problems
• On some matching problems arising in vehicle scheduling models

This page was built for publication: Approximation algorithms for a vehicle routing problem