A polynomial-time exact algorithm for k-depot capacitated vehicle routing problem on a tree

DOI10.1155/2021/6648044zbMATH Open1512.90045MaRDI QIDQ6483737FDOQ6483737

Authors: Liang Xu, Tong Zhang, Rantao Hu, Jialing Guo 

Publication date: 3 May 2021

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Recommendations

• Two exact algorithms for the vehicle routing problem on trees
• scientific article; zbMATH DE number 1522939
• Capacitated Vehicle Routing on Trees
• A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
• scientific article; zbMATH DE number 1303035

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Cited In (2)

• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• Two exact algorithms for the vehicle routing problem on trees

This page was built for publication: A polynomial-time exact algorithm for \(k\)-depot capacitated vehicle routing problem on a tree

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