An Approximation Algorithm for k-Depot Split Delivery Vehicle Routing Problem

DOI10.1287/IJOC.2021.0193MaRDI QIDQ6200149zbMATH OpenFDO

Authors Xiaofan Lai, Liang Xu, Zhou Xu, Yang Du

Publication date 22 March 2024

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/IJOC.2021.0193

zbMATH Keywords

approximation algorithmsplit deliveryultiple depotvehicle routing problem

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cited in

(4)

• Improved approximation algorithms for multidepot capacitated vehicle routing
• Approximating split delivery path routing problems
• Multidepot capacitated vehicle routing with improved approximation guarantees
• Enhanced approximation algorithms for the capacitated location routing problem

This page was built for publication: An Approximation Algorithm for k-Depot Split Delivery Vehicle Routing Problem

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