On Gale's feasibility theorem for certain infinite networks
From MaRDI portal
(Redirected from Publication:1323136)
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
Cites work
- scientific article; zbMATH DE number 3824559 (Why is no real title available?)
- scientific article; zbMATH DE number 3751583 (Why is no real title available?)
- A Ford-Fulkerson type theorem concerning vector-valued flows in infinite networks
- A theorem on flows in networks
- Extremum problems on an infinite network
Cited in
(7)- scientific article; zbMATH DE number 3860851 (Why is no real title available?)
- The Max-Flow Min-Cut theorem for countable networks
- scientific article; zbMATH DE number 3928683 (Why is no real title available?)
- scientific article; zbMATH DE number 1377930 (Why is no real title available?)
- Duality theorems on an infinite network*
- 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
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)
