A bicriteria approximation algorithm for DVRP with time windows

DOI10.1007/978-3-319-12691-3_18zbMATH Open1431.90016OpenAlexW432108322MaRDI QIDQ2942399FDOQ2942399

Authors: Hao Gu, Liang Song, H.-J. Huang, Hongwei Du 

Publication date: 11 September 2015

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-12691-3_18

Recommendations

• Approximation schemes for Euclidean vehicle routing problems with time windows
• Approximation algorithms for deadline-TSP and vehicle routing with time-windows
• A quasi-polynomial time approximation scheme for Euclidean CVRPTW
• scientific article; zbMATH DE number 4047423
• Approximation algorithms for some vehicle routing problems

zbMATH Keywords

approximation algorithmmetric spaceDVRPTW

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation algorithms (68W25) Transportation, logistics and supply chain management (90B06)

Cited In (1)

• Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity

This page was built for publication: A bicriteria approximation algorithm for DVRP with time windows

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