Parallel asynchronous label-correcting methods for shortest paths

DOI10.1007/BF02192173zbMath0842.90115MaRDI QIDQ1908632

Roberto Musmanno, Dimitri P. Bertsekas, Francesca Guerriero

Publication date: 6 August 1996

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

zbMATH Keywords

shortest path problemsshared-memory multiprocessorlabel-correcting methodsparallel asynchronous implementations

Mathematics Subject Classification ID

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

Related Items

MG-FIM: A Multi-GPU Fast Iterative Method Using Adaptive Domain Decomposition ⋮ Parallel asynchronous label-correcting methods for shortest paths ⋮ 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 asynchronous algorithms for the \(K\) shortest paths problem ⋮ Multicriteria adaptive paths in stochastic, time-varying networks ⋮ Label correcting methods to solve multicriteria shortest path problems ⋮ An auction-based approach for the re-optimization shortest path tree problem ⋮ Robust shortest path planning and semicontractive dynamic programming

Uses Software

• NETGEN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
• A parallel shortest path algorithm
• Parallel synchronous and asynchronous implementations of the auction algorithm
• The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm
• Parallel shortest path auction algorithms
• Polynomial auction algorithms for shortest paths
• Parallel asynchronous label-correcting methods for shortest paths
• Shortest path methods: A unifying approach
• Distributed dynamic programming
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• A simple and fast label correcting algorithm for shortest paths
• Implementation and efficiency of Moore-algorithms for the shortest route problem