Pages that link to "Item:Q1322557"
From MaRDI portal
The following pages link to Examples of max-flow and min-cut problems with duality gaps in continuous networks (Q1322557):
Displaying 7 items.
- Maximum flows and minimum cuts in the plane (Q989897) (← links)
- A relaxation of min-cut problem in an anisotropic continuous network (Q1292201) (← links)
- Duality theorems for a continuous analog of Ford-Fulkerson flows in networks (Q1325747) (← links)
- A spatially continuous max-flow and min-cut framework for binary labeling problems (Q2454034) (← links)
- Maximum Flows and Minimum Cuts in the Plane (Q3565455) (← links)
- A maximin cut problem on an infinite network (Q3988302) (← links)
- A fast Fourier transform based method for computing the effective crack energy of a heterogeneous material on a combinatorially consistent grid (Q6554004) (← links)