On the maximum capacity augmentation algorithm for the maximum flow problem

DOI10.1016/0166-218X(93)90148-HzbMath0810.90033OpenAlexW2091599791WikidataQ127846169 ScholiaQ127846169MaRDI QIDQ1314319

Jianxiu Hao, Donald Goldfarb

Publication date: 22 February 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(93)90148-h

zbMATH Keywords

polynomial boundsmaximum capacitated flownetwork simplex implementationpath-augmentation algorithm

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time
• A strongly polynomial minimum cost circulation algorithm
• Use of dynamic trees in a network simplex algorithm for the maximum flow problem
• Algorithms for maximum network flow
• Theoretical Efficiency of the Algorithm “Capacity” for the Maximum Flow Problem
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

This page was built for publication: On the maximum capacity augmentation algorithm for the maximum flow problem