A new scaling algorithm for the minimum cost network flow problem
type: Item
instance of: scholarly article
title: A new scaling algorithm for the minimum cost network flow problem
zbMATH Open document ID: 0961.90011
DOI: 10.1016/S0167-6377(99)00047-4
author: Donald Goldfarb
author: Zhiying Jin
published in: Operations Research Letters
publication date: 2000-12-12T00:00:00Z
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 1419832
zbMATH Keywords: polynomial algorithm
zbMATH Keywords: excess scaling algorithm
MaRDI profile type: Publication
cites work: Finding minimum-cost flows by double scaling
cites work: Q3056948
cites work: A capacity scaling algorithm for the constrained maximum flow problem
cites work: Q4283439
cites work: On the computational behavior of a polynomial-time network flow algorithm
cites work: A note on two problems in connexion with graphs
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: Fibonacci heaps and their uses in improved network optimization algorithms
cites work: Q4283443
cites work: Scaling algorithms for network problems
cites work: Q4283440
cites work: Finding Minimum-Cost Circulations by Successive Approximation
cites work: A Faster Combinatorial Algorithm for the Generalized Circulation Problem
cites work: Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem
cites work: Computational experience with a polynomial-time dual simplex algorithm for the transportation problem
cites work: A Faster Strongly Polynomial Minimum Cost Flow Algorithm
cites work: Polynomial dual network simplex algorithms
cites work: Q3908745
cites work: A strongly polynomial minimum cost circulation algorithm
description: scientific article; zbMATH DE number 1419832