Parallel asynchronous label-correcting methods for shortest paths

DOI10.1007/BF02192173MaRDI QIDQ1908632zbMATH OpenFDO

Authors Dimitri P. Bertsekas, Roberto Musmanno, Francesca Guerriero

Publication date 6 August 1996

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02192173

zbMATH Keywords

shortest path problemsshared-memory multiprocessorlabel-correcting methodsparallel asynchronous implementations

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Programming involving graphs or networks (90C35)

Recommendations

• Parallel asynchronous algorithms for the K shortest paths problem
• Parallel shortest path auction algorithms
• Parallel Algorithms for Dynamic Shortest Path Problems
• Shortest path methods: A unifying approach
• A simple and fast label correcting algorithm for shortest paths

Cites work

• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 51132 (Why is no real title available?)
• scientific article; zbMATH DE number 53116 (Why is no real title available?)
• A parallel shortest path algorithm
• A simple and fast label correcting algorithm for shortest paths
• Distributed dynamic programming
• Implementation and efficiency of Moore-algorithms for the shortest route problem
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• Parallel asynchronous label-correcting methods for shortest paths
• Parallel shortest path auction algorithms
• Parallel synchronous and asynchronous implementations of the auction algorithm
• Polynomial auction algorithms for shortest paths
• Shortest path methods: A unifying approach
• Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
• The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm

Cited in

(14)

• MG-FIM: a multi-GPU fast iterative method using adaptive domain decomposition
• A simple and fast label correcting algorithm for shortest paths
• Robust shortest path planning and semicontractive dynamic programming
• Parallel asynchronous label-correcting methods for shortest paths
• scientific article; zbMATH DE number 6452892 (Why is no real title available?)
• Parallel asynchronous algorithms for discrete data
• Label correcting methods to solve multicriteria shortest path problems
• An auction-based approach for the re-optimization shortest path tree problem
• Temporal shortest paths: Parallel computing implementations
• The interactive analysis of the multicriteria shortest path problem by the reference point method.
• Tree-deletion pruning in label-correcting algorithms for the multiobjective shortest path problem
• Parallel shortest path auction algorithms
• Parallel asynchronous algorithms for the K shortest paths problem
• Multicriteria adaptive paths in stochastic, time-varying networks

Describes a project that uses

Uses Software

• NETGEN

This page was built for publication: Parallel asynchronous label-correcting methods for shortest paths

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