A generalization of max flow—min cut
From MaRDI portal
Publication:4133435
Cites work
Cited in
(53)- Decomposition of probability marginals for security games in abstract networks
- Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation
- Protection of flows under targeted attacks
- On total dual integrality
- The max-flow min-cut property and \(\pm 1\)-resistant sets
- On a composition of independence systems by circuit identification
- A notion of total dual integrality for convex, semidefinite, and extended formulations
- Polyhedral Combinatorics in Combinatorial Optimization
- Abstract flows over time: a first step towards solving dynamic packing problems
- Rerouting Flows when Links Fail
- A primal-dual algorithm for weighted abstract cut packing
- An analytical comparison of different formulations of the travelling salesman problem
- Total dual integrality implies local strong unimodularity
- Intersecting restrictions in clutters
- Extending Greene's theorem to directed graphs
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
- Nowhere-zero flows in random graphs
- On switching paths polyhedra
- A min-max relation for stable sets in graphs with no odd-\(K_ 4\)
- Path-closed sets
- A Minimal Totally Dual Integral Defining System for the b-Matching Polyhedron
- Separation, dimension, and facet algorithms for node flow polyhedra
- On Packing Dijoins in Digraphs and Weighted Digraphs
- Flows on measurable spaces
- On totally dual integral systems
- On partitions of a partially ordered set
- Operations that preserve total dual integrality
- Generalized polymatroids and submodular flows
- A critical survey on the network optimization algorithms for evacuation planning problems
- Algorithms and complexity analysis for some flow problems
- Polyhedral proof methods in combinatorial optimization
- Integral infeasibility and testing total dual integrality
- Total weak unimodularity: Testing and applications
- Matchings and covers in hypergraphs
- An integer analogue of Carathéodory's theorem
- A system of linear inequalities with a submodular function on \(\{0,\pm 1\}\) vectors
- On superperfection of edge intersection graphs of paths
- A strongly polynomial algorithm for the uniform balanced network flow problem
- Connected and alternating vectors: Polyhedra and algorithms
- Proving total dual integrality with cross-free families—A general framework
- Circuits in graphs embedded on the torus
- Solving a capacitated hub location problem
- Total dual integrality and b-matchings
- Efficient algorithms for abstract flow with partial switching
- Recent trends in combinatorial optimization
- Abstract network flow with intermediate storage for evacuation planning
- On non-superperfection of edge intersection graphs of paths
- Switchdec polyhedra
- On the vehicle routing problem with lower bound capacities
- On the interval chromatic number of proper interval graphs
- On box totally dual integral polyhedra
- Cuboids, a class of clutters
- A min-max relation for \(K_ 3\)-covers in graphs noncontractible to \(K_ 5\backslash e\)
This page was built for publication: A generalization of max flow—min cut
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4133435)
