Note on Weintraub’s Minimum-Cost Circulation Algorithm
From MaRDI portal
Publication:3829324
DOI10.1137/0218039zbMath0674.90025OpenAlexW2047001449MaRDI QIDQ3829324
Francisco Barahona, Éva Tardos
Publication date: 1989
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0218039
scalingpolynomial timemaximum flowaugmenting pathconvex cost functionresidual graphlinear objective functionminimum-cost circulation
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10)
Related Items (8)
How to compute least infeasible flows ⋮ Minimum-cost flow algorithms: an experimental evaluation ⋮ Inapproximability of shortest paths on perfect matching polytopes ⋮ Algorithms for the minimum cost circulation problem based on maximizing the mean improvement ⋮ Minimum ratio canceling in oracle polynomial for linear programming, but not strongly polynomial, even for networks ⋮ Maximum utility product pricing models and algorithms based on reservation price ⋮ New polynomial-time cycle-canceling algorithms for minimum-cost flows ⋮ Pivot Rules for Circuit-Augmentation Algorithms in Linear Optimization
This page was built for publication: Note on Weintraub’s Minimum-Cost Circulation Algorithm
