Routing algorithms with range restriction in sparse supply networks

DOI10.1260/1748-3018.7.2.145zbMATH Open1280.90010OpenAlexW1980595989MaRDI QIDQ5396352FDOQ5396352

Authors: Thomas Kämpke 

Publication date: 5 February 2014

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

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

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

Mathematics Subject Classification ID

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

Cited In (2)

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

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)