Maximum flows and minimum cuts in the plane
From MaRDI portal
Publication:989897
DOI10.1007/S10898-009-9471-6zbMATH Open1207.49042OpenAlexW2088979591MaRDI QIDQ989897FDOQ989897
Authors: Gilbert Strang
Publication date: 23 August 2010
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/116027
Recommendations
PDEs in connection with control and optimization (35Q93) Linear optimal control problems (49N05) Duality theory (optimization) (49N15)
Cites Work
- Maximal Flow Through a Network
- Title not available (Why is that?)
- Title not available (Why is that?)
- Eigenvalues and expanders
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dual spaces of stresses and strains, with applications to Hencky plasticity
- Geometric bounds for eigenvalues of Markov chains
- Laplacians and the Cheeger inequality for directed graphs
- Title not available (Why is that?)
- The Isoperimetric Problem in the Minkowski Plane
- An integral formula for total gradient variation
- Title not available (Why is that?)
- Maximal flow through a domain
- Title not available (Why is that?)
- Maximum area with Minkowski measures of perimeter
- Title not available (Why is that?)
- Max-flow min-cut theorem in an anisotropic network
- The first eigenvalue of the Laplacian, isoperimetric constants, and the max flow min cut theorem
- Title not available (Why is that?)
- Examples of max-flow and min-cut problems with duality gaps in continuous networks
- Duality theorems for a continuous analog of Ford-Fulkerson flows in networks
- Analysis of an inverse problem arising in photolithography
- Discrete Approximations to Continuum Optimal Flow Problems
Cited In (17)
- On the Cheeger sets in strips and non-convex domains
- The Cheeger cut and Cheeger problem in metric measure spaces
- Combinatorial continuous maximum flow
- Title not available (Why is that?)
- On maximum flows in polyhedral domains
- An overview on the Cheeger problem
- Maximum cuts for a minimum flow
- Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
- Lattices with finite renormalized Coulombian interaction energy in the plane
- Maximum flows and minimum cuts in the plane
- Optimal geometric flows via dual programs
- The Cheeger cut and Cheeger problem in metric graphs
- Approximation of maximal Cheeger sets by projection
- An introduction to continuous optimization for imaging
- Discrete Approximations to Continuum Optimal Flow Problems
- Geometric criteria for the existence of capillary surfaces in tubes
- Title not available (Why is that?)
Uses Software
This page was built for publication: Maximum flows and minimum cuts in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989897)