A Faster Combinatorial Algorithm for the Generalized Circulation Problem

DOI10.1287/moor.21.3.529zbMath0873.90100OpenAlexW2150492728MaRDI QIDQ4716922

Zhiying Jin, Donald Goldfarb

Publication date: 30 October 1997

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.21.3.529

zbMATH Keywords

worst-case complexitygeneralized maximum flowgeneralized circulation problemarc imbalancepseudo-flow augmentation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (4)

Improving time bounds on maximum generalised flow computations by contracting the network ⋮ A Strongly Polynomial Algorithm for Generalized Flow Maximization ⋮ A new scaling algorithm for the minimum cost network flow problem ⋮ A simple GAP-canceling algorithm for the generalized maximum flow problem

This page was built for publication: A Faster Combinatorial Algorithm for the Generalized Circulation Problem