The following pages link to (Q3673434):
Displaying 4 items.
- A measure-theoretical max-flow-min-cut problem (Q583082) (← links)
- Measure theoretic versions of linear programming (Q1092811) (← links)
- Examples of max-flow and min-cut problems with duality gaps in continuous networks (Q1322557) (← links)
- A continuous analog of Ford-Fulkerson flows in networks and its application to a problem of Rota (Q1814142) (← links)