Maximum cuts for a minimum flow
From MaRDI portal
Recommendations
- Maximum flows and minimum cuts in the plane
- Maximum flows and minimum cuts in the plane
- Maximum concurrent flows and minimum cuts
- scientific article; zbMATH DE number 2190137
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Minimum flow variation in maximum flows
- Inverse maximum flow and minimum cut problems
- The maximum cut problem
- A measure-theoretical max-flow-min-cut problem
Cited in
(15)- Invariant sets of arcs in network flow problems
- Families of cuts with the MFMC-property
- Maximum concurrent flows and minimum cuts
- An analytic symmetrization of max flow-min cut
- How to compute least infeasible flows
- Minimum cut problem using bases of extended polymatroids
- Max-flow min-cut theorem in an anisotropic network
- A note on the problem of r disjoint (s, t)-cuts and some related issues
- A new approach for computing a most positive cut using the minimum flow algorithms
- scientific article; zbMATH DE number 4207199 (Why is no real title available?)
- On node constraint networks
- Exact cuts in networks
- scientific article; zbMATH DE number 32325 (Why is no real title available?)
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts
This page was built for publication: Maximum cuts for a minimum flow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806718)
