Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Parallel algorithms for solving aggregated shortest-path problems

From MaRDI portal
Publication:1304488
Jump to:navigation, search

DOI10.1016/S0305-0548(99)00029-5zbMath0938.90010OpenAlexW2042026447MaRDI QIDQ1304488

Robert L. Smith, H. Edwin Romeijn

Publication date: 22 September 1999

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(99)00029-5


zbMATH Keywords

error boundsparallel algorithmsshortest pathshierarchical network decomposition algorithm


Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)







This page was built for publication: Parallel algorithms for solving aggregated shortest-path problems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1304488&oldid=13415361"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 11:16.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki