An auction algorithm for the max-flow problem
type: Item
instance of: scholarly article
title: An auction algorithm for the max-flow problem
zbMATH Open document ID: 0843.90044
DOI: 10.1007/BF02192042
author: Dimitri P. Bertsekas
published in: Journal of Optimization Theory and Applications
publication date: 1996-02-21T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 841718
zbMATH Keywords: network optimization
zbMATH Keywords: max-flow problem
zbMATH Keywords: sequence of augmentations along paths
zbMATH Keywords: auction-like algorithm
zbMATH Keywords: preflow-push algorithms
describes a project that uses: NETGEN
describes a project that uses: RELAX4
MaRDI profile type: Publication
cites work: Maximal Flow Through a Network
cites work: Q3292914
cites work: Q4739657
cites work: Q4003376
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: Q5624995
cites work: Q4058442
cites work: An O(n2log n) parallel max-flow algorithm
cites work: A Fast and Simple Algorithm for the Maximum Flow Problem
cites work: Analysis of Preflow Push Algorithms for Maximum Network Flow
cites work: Implementing Goldberg's max-flow-algorithm ? A computational investigation
cites work: The maximum flow problem: A max-preflow approach
cites work: Q4311901
cites work: Q4283434
cites work: Q4283435
cites work: An Auction Algorithm for Shortest Paths
cites work: Polynomial auction algorithms for shortest paths
cites work: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
cites work: Auction algorithms for network flow problems: A tutorial introduction
description: scientific article; zbMATH DE number 841718