A generalization of max flow—min cut
From MaRDI portal
Publication:4133435
DOI10.1007/BF01580250zbMath0357.90068MaRDI QIDQ4133435
Publication date: 1974
Published in: Mathematical Programming (Search for Journal in Brave)
90C35: Programming involving graphs or networks
Related Items
On switching paths polyhedra, A min-max relation for stable sets in graphs with no odd-\(K_ 4\), Integral infeasibility and testing total dual integrality, A system of linear inequalities with a submodular function on \(\{0,\pm 1\}\) vectors, Recent trends in combinatorial optimization, Total weak unimodularity: Testing and applications, Path-closed sets, The multi-commodity one-to-one pickup-and-delivery traveling salesman problem, An integer analogue of Carathéodory's theorem, Polyhedral proof methods in combinatorial optimization, Generalized polymatroids and submodular flows, On total dual integrality, Total dual integrality and b-matchings, An analytical comparison of different formulations of the travelling salesman problem, On a composition of independence systems by circuit identification, Circuits in graphs embedded on the torus, On partitions of a partially ordered set, Algorithms and complexity analysis for some flow problems, Switchdec polyhedra, A strongly polynomial algorithm for the uniform balanced network flow problem, Matchings and covers in hypergraphs, On totally dual integral systems, Operations that preserve total dual integrality, Extending Greene's theorem to directed graphs, Nowhere-zero flows in random graphs, A min-max relation for \(K_ 3\)-covers in graphs noncontractible to \(K_ 5\backslash e\), Solving a capacitated hub location problem, Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation, Separation, dimension, and facet algorithms for node flow polyhedra, Proving total dual integrality with cross-free families—A general framework, A Minimal Totally Dual Integral Defining System for the b-Matching Polyhedron, On box totally dual integral polyhedra, Polyhedral Combinatorics in Combinatorial Optimization, Total dual integrality implies local strong unimodularity, Connected and alternating vectors: Polyhedra and algorithms
Cites Work
