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

DOI10.1155/2021/6648044MaRDI QIDQ6483737zbMATH OpenFDO

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)

Copyright license Creative Commons Attribution 4.0 International

Mathematics Subject Classification ID

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

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

Cited in

(2)

• Two exact algorithms for the vehicle routing problem on trees
• Optimal Solution of Vehicle Routing Problems Using Minimum K-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)