scientific article
From MaRDI portal
Publication:3352816
zbMath0728.90035MaRDI QIDQ3352816
Éva Tardos, Andrew V. Goldberg, Robert Endre Tarjan
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveymaximum flowminimum-cost circulationefficient polynomial algorithmsflows with losses and gains
Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (31)
Balancing problems in acyclic networks ⋮ Fair matchings and related problems ⋮ Approximate decision algorithms for point set congruence ⋮ Minimum cost multiflows in undirected networks ⋮ A network flow algorithm for just-in-time project scheduling ⋮ Dynamic expression trees ⋮ Multiflows and disjoint paths of minimum total cost ⋮ Performance driven k-layer wiring ⋮ On implementing push-relabel method for the maximum flow problem ⋮ Circulations, Fuzzy Relations and Semirings ⋮ Local distance constrained bribery in voting ⋮ Convexification of generalized network flow problem ⋮ Complexity of strict robust integer minimum cost flow problems: an overview and further results ⋮ Processor-efficient implementation of a maximum flow algorithm ⋮ On the computational behavior of a polynomial-time network flow algorithm ⋮ Upper bounds for the diameter and height of graphs of convex polyhedra ⋮ A natural randomization strategy for multicommodity flow and related algorithms ⋮ Matching theory -- a sampler: From Dénes König to the present ⋮ Polynomial dual network simplex algorithms ⋮ Network design and flow problems with cross-arc costs ⋮ On the Pythagorean Structure of the Optimal Transport for Separable Cost Functions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Inverse problems of submodular functions on digraphs ⋮ Isolation branching: a branch and bound algorithm for the \(k \)-terminal cut problem ⋮ On the maximum capacity augmentation algorithm for the maximum flow problem ⋮ Tight bounds on the number of minimum-mean cycle cancellations and related results ⋮ Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs ⋮ A faster parametric minimum-cut algorithm ⋮ Algorithms and complexity analysis for some flow problems ⋮ Parallel algorithms for the assignment and minimum-cost flow problems
This page was built for publication:
