Maximal flow through a domain
From MaRDI portal
Publication:3659497
DOI10.1007/BF02592050zbMath0513.90026MaRDI QIDQ3659497
Publication date: 1983
Published in: Mathematical Programming (Search for Journal in Brave)
functions of bounded variationcontinuous programmingminimal cutcontinuous problemflows described by a vector fieldmaximal flow through a domain
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Functions of bounded variation, generalizations (26A45)
Related Items (49)
Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance ⋮ Fenchel duality and smoothness of solution of the optimal routing problem ⋮ Symmetry analysis of an equation for constrained optimal transport, modelling the distribution of ants round a nest ⋮ Riemannian and Lorentzian flow-cut theorems ⋮ A primal-dual active-set algorithm for bilaterally constrained total variation deblurring and piecewise constant Mumford-Shah segmentation problems ⋮ Bit threads and holographic monogamy ⋮ Completely convex formulation of the Chan-Vese image segmentation model ⋮ The Cheeger cut and Cheeger problem in metric graphs ⋮ Covariant bit threads ⋮ Minimum shared‐power edge cut ⋮ Global minimization for continuous multiphase partitioning problems using a dual approach ⋮ The Cheeger cut and Cheeger problem in metric measure spaces ⋮ The Cheeger problem in abstract measure spaces ⋮ Routing multi-class traffic flows in the plane ⋮ Investigations on the influence of the boundary conditions when computing the effective crack energy of random heterogeneous materials using fast marching methods ⋮ On maximum flows in polyhedral domains ⋮ Maximal stream and minimal cutset for first passage percolation through a domain of \(\mathbb{R}^{d}\) ⋮ A spatially continuous max-flow and min-cut framework for binary labeling problems ⋮ Applications of conic programming in non-smooth mechanics ⋮ Cheeger sets for rotationally symmetric planar convex bodies ⋮ Extended least action principle for steady flows under a prescribed flux ⋮ Maximum Flows and Minimum Cuts in the Plane ⋮ Canonical Duality Theory: Connections between Nonconvex Mechanics and Global Optimization ⋮ Bit threads and holographic entanglement ⋮ Maximum thick paths in static and dynamic environments ⋮ Multi-class transductive learning based on \(\ell^1\) relaxations of Cheeger cut and Mumford-Shah-Potts model ⋮ Discrete and continuous models for partitioning problems ⋮ Limit theorems for optimal mass transportation and applications to networks ⋮ An introduction to continuous optimization for imaging ⋮ Uniqueness of the Cheeger set of a convex body ⋮ Extension theorems for vector valued maps ⋮ Sharp inequalities involving the Cheeger constant of planar convex sets ⋮ Geometrizing the partial entanglement entropy: from PEE threads to bit threads ⋮ An FFT-based method for computing weighted minimal surfaces in microstructures with applications to the computational homogenization of brittle fracture ⋮ Numerical Methods and Applications in Total Variation Image Restoration ⋮ Maximum flows and minimum cuts in the plane ⋮ Some remarks on uniqueness and regularity of Cheeger sets ⋮ Approximation of maximal Cheeger sets by projection ⋮ Extending the Power Watershed Framework Thanks to $\Gamma$-Convergence ⋮ A fast Fourier transform based method for computing the effective crack energy of a heterogeneous material on a combinatorially consistent grid ⋮ The Potts model with different piecewise constant representations and fast algorithms: a survey ⋮ Holographic thermal entropy from geodesic bit threads ⋮ An edge driven wavelet frame model for image restoration ⋮ A PROJECTION APPROACH TO THE NUMERICAL ANALYSIS OF LIMIT LOAD PROBLEMS ⋮ Towards a bit threads derivation of holographic entanglement of purification ⋮ Convex programs for minimal-area problems ⋮ Efficient global minimization methods for image segmentation models with four regions ⋮ Computing the effective crack energy of heterogeneous and anisotropic microstructures via anisotropic minimal surfaces ⋮ Examples of max-flow and min-cut problems with duality gaps in continuous networks
Cites Work
- Functions with generalized gradient and generalized surfaces
- An integral formula for total gradient variation
- On capillary free surfaces in the absence of gravity
- On the equation of surfaces of prescribed mean curvature. Existence and uniqueness without boundary conditions
- Su una teoria generale della misura \((r-1)\)-dimensionale in uno spazio ad \(r\) dimensioni
- A problem in capillarity and plasticity
- Extension of range of functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Maximal flow through a domain
