Parallel Algorithms for Dynamic Shortest Path Problems

DOI10.1111/1475-3995.00356MaRDI QIDQ4550037zbMATH OpenOpenAlexFDO

Authors Ismail Chabini, Sridevi Ganugapati

Publication date 12 February 2003

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/1475-3995.00356

zbMATH Keywords

computer algorithmsdynamic networksdynamic shortest pathsintelligent transportation systemsparallel and distributed computing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• Parallel algorithms for solving aggregated shortest-path problems
• scientific article; zbMATH DE number 56471
• On-line and dynamic algorithms for shortest path problems
• Parallel shortest path auction algorithms
• scientific article; zbMATH DE number 278831

Cited in

(16)

• A parallel shortest path algorithm
• Parallel algorithms for solving aggregated shortest-path problems
• Parallel asynchronous label-correcting methods for shortest paths
• Efficient parallel processing methods for road map queries
• Parallel Algorithms for Network Routing Problems and Recurrences
• scientific article; zbMATH DE number 735432 (Why is no real title available?)
• scientific article; zbMATH DE number 1057774 (Why is no real title available?)
• A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer Architectures
• Design and research of parallel schemes for the Dantzig algorithm
• scientific article; zbMATH DE number 7266346 (Why is no real title available?)
• scientific article; zbMATH DE number 6452892 (Why is no real title available?)
• scientific article; zbMATH DE number 278831 (Why is no real title available?)
• Computational Science – ICCS 2005
• Implementing parallel shortest path for parallel transportation applications
• Temporal shortest paths: Parallel computing implementations
• Finding the shortest path with honey-bee mating optimization algorithm in project management problems with constrained/unconstrained resources

This page was built for publication: Parallel Algorithms for Dynamic Shortest Path Problems

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