A polynomial cycle canceling algorithm for submodular flows
From MaRDI portal
Publication:1806021
DOI10.1007/s101070050076zbMath1096.90545OpenAlexW2077627071MaRDI QIDQ1806021
C. Wallacher, Uwe T. Zimmermann
Publication date: 1999
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070050076
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)
Related Items (4)
A fast cost scaling algorithm for submodular flow ⋮ On circuit diameter bounds via circuit imbalances ⋮ A Push/Relabel framework for submodular flows and its definement for 0-1 submodular flows ⋮ Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games
This page was built for publication: A polynomial cycle canceling algorithm for submodular flows
