On the tour partitioning heuristic for the unit demand capacitated vehicle routing problem

DOI10.1016/J.ORL.2006.06.002zbMath1180.90054OpenAlexW1968306102MaRDI QIDQ2467480

Thomas R. Sexton, Herbert F. Lewis

Publication date: 21 January 2008

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2006.06.002

zbMATH Keywords

analysis of algorithms

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)

Cites Work

• Unnamed Item
• Unnamed Item
• Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
• Bounds and Heuristics for Capacitated Routing Problems

This page was built for publication: On the tour partitioning heuristic for the unit demand capacitated vehicle routing problem