Polynomial auction algorithms for shortest paths
type: Item
instance of: scholarly article
title: Polynomial auction algorithms for shortest paths
zbMATH Open document ID: 0835.90111
DOI: 10.1007/BF01302891
author: Dimitri P. Bertsekas
author: Stefano Pallottino
author: Maria Grazia Scutellà
published in: Computational Optimization and Applications
publication date: 1995-06-11T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 91B26
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 755301
zbMATH Keywords: shortest path
zbMATH Keywords: network optimization
zbMATH Keywords: strongly polynomial variations
zbMATH Keywords: auction algorithm
describes a project that uses: NETGEN
MaRDI profile type: Publication
cites work: A new algorithm for the assignment problem
cites work: An Auction Algorithm for Shortest Paths
cites work: Q4003376
cites work: An \(O(EV\log^2V)\) algorithm for the maximal flow problem
cites work: Shortest path methods: A unifying approach
cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
cites work: Q4739657
full work available at URL: https://doi.org/10.1007/bf01302891
OpenAlex ID: W2119991623
description: scientific article; zbMATH DE number 755301