Routing algorithms with range restriction in sparse supply networks

DOI10.1260/1748-3018.7.2.145MaRDI QIDQ5396352zbMATH OpenOpenAlexFDO

Authors Thomas Kämpke

Publication date 5 February 2014

Published in Journal of Algorithms & Computational Technology (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1260/1748-3018.7.2.145

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Multi-objective and goal programming (90C29)

Recommendations

• The shortest path problem on large-scale real-road networks
• scientific article; zbMATH DE number 7121919
• scientific article; zbMATH DE number 938615
• An Appraisal of Some Shortest-Path Algorithms
• Computing the nxm shortest path efficiently

Cited in

(2)

• Research on routing algorithm based on limitation arrangement principle in mathematics
• Finding Optimal Refueling Policies in Transportation Networks

This page was built for publication: Routing algorithms with range restriction in sparse supply networks

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