On Gale's feasibility theorem for certain infinite networks

DOI10.1007/BF01201792zbMATH Open0827.90052OpenAlexW2027795790MaRDI QIDQ1323136FDOQ1323136

Authors: 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

Recommendations

• scientific article; zbMATH DE number 3928683
• scientific article; zbMATH DE number 967076
• Some potential theoretic results on an infinite network
• Duality theorems on an infinite network^*
• scientific article; zbMATH DE number 1486933
• Bôcher's theorem in an infinite network
• scientific article; zbMATH DE number 1377930
• Gale's feasibility theorem and max-flow problems in a continuous network.
• Dirichlet problem in infinite networks
• scientific article; zbMATH DE number 1308987

zbMATH Keywords

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

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cites Work

• A theorem on flows in networks
• Title not available (Why is that?)
• Extremum problems on an infinite network
• A Ford-Fulkerson type theorem concerning vector-valued flows in infinite networks
• Title not available (Why is that?)

Cited In (7)

• Duality theorems on an infinite network^*
• Title not available (Why is that?)
• Title not available (Why is that?)
• A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory
• The generalized strong isoperimetric inequality in locally finite networks
• Title not available (Why is that?)
• The Max-Flow Min-Cut theorem for countable networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1323136)