Parallel asynchronous label-correcting methods for shortest paths
type: Item
instance of: scholarly article
title: Parallel asynchronous label-correcting methods for shortest paths
zbMATH Open document ID: 0842.90115
DOI: 10.1007/BF02192173
author: Dimitri P. Bertsekas
author: Roberto Musmanno
author: Francesca Guerriero
published in: Journal of Optimization Theory and Applications
publication date: 1996-08-06T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 65Y05
zbMATH DE Number: 851099
zbMATH Keywords: shortest path problems
zbMATH Keywords: parallel asynchronous implementations
zbMATH Keywords: label-correcting methods
zbMATH Keywords: shared-memory multiprocessor
describes a project that uses: NETGEN
MaRDI profile type: Publication
cites work: Polynomial auction algorithms for shortest paths
cites work: The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm
cites work: Parallel shortest path auction algorithms
cites work: Shortest path methods: A unifying approach
cites work: Q3241581
cites work: A simple and fast label correcting algorithm for shortest paths
cites work: Implementation and efficiency of Moore-algorithms for the shortest route problem
cites work: Q4003376
cites work: Distributed dynamic programming
cites work: Q4001523
cites work: A parallel shortest path algorithm
cites work: Parallel synchronous and asynchronous implementations of the auction algorithm
cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
cites work: Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
description: scientific article; zbMATH DE number 851099