On Gale's feasibility theorem for certain infinite networks

DOI10.1007/BF01201792zbMath0827.90052OpenAlexW2027795790MaRDI QIDQ1323136

Werner Oettli, Maretsugu Yamasaki

Publication date: 9 May 1994

Published in: Archiv der Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01201792

zbMATH Keywords

max-flow min-cut theoreminfinite networksGale's feasibility theoremlocally finite networks

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (1)

The generalized strong isoperimetric inequality in locally finite networks

Cites Work

• Unnamed Item
• Unnamed Item
• A theorem on flows in networks
• Extremum problems on an infinite network
• A Ford-Fulkerson type theorem concerning vector-valued flows in infinite networks

This page was built for publication: On Gale's feasibility theorem for certain infinite networks