Parallel asynchronous label-correcting methods for shortest paths
From MaRDI portal
Publication:1908632
DOI10.1007/BF02192173zbMATH Open0842.90115MaRDI QIDQ1908632FDOQ1908632
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)
Recommendations
shortest path problemsshared-memory multiprocessorlabel-correcting methodsparallel asynchronous implementations
Cites Work
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
- Shortest path methods: A unifying approach
- Distributed dynamic programming
- Implementation and efficiency of Moore-algorithms for the shortest route problem
- Title not available (Why is that?)
- A simple and fast label correcting algorithm for shortest paths
- Polynomial auction algorithms for shortest paths
- Parallel synchronous and asynchronous implementations of the auction algorithm
- A parallel shortest path algorithm
- Parallel shortest path auction algorithms
- The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm
- Parallel asynchronous label-correcting methods for shortest paths
Cited In (14)
- A simple and fast label correcting algorithm for shortest paths
- Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem
- Robust shortest path planning and semicontractive dynamic programming
- Title not available (Why is that?)
- Parallel asynchronous label-correcting methods for shortest paths
- Parallel asynchronous algorithms for discrete data
- MG-FIM: A Multi-GPU Fast Iterative Method Using Adaptive Domain Decomposition
- 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.
- Parallel shortest path auction algorithms
- Parallel asynchronous algorithms for the \(K\) shortest paths problem
- Multicriteria adaptive paths in stochastic, time-varying networks
Uses Software
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)
