Maximal Flow Through a Network
This paper is under a licence that does not allow it to be reproduced, so what is here is its front matter and a short abstract. Read it at the publisher's page.
English
中文
最大流通过网络
“考虑一个铁路网络，通过若干中间城市连接两个城市，其中网络的每条链路都有一个表示其容量的数字。假设处于稳态，求从一个给定城市到另一个城市的最大流。”
L. R. Ford, Jr. and D. R. Fulkerson
This section is missing here.
References
- G. B. Dantzig, *Maximization of a linear function of variables subject to linear inequalities: Activity analysis of production and allocation* (Cowles Commission, 1951).
- H. Whitney, *Non-separable and planar graphs*, Trans. Amer. Math. Soc., *34* (1932), 339–362.
- ———, *Planar graphs*, Fundamenta Mathematicae, *21* (1933), 73–84. Rand Corporation, Santi Monica, California
Read off the page by a vision model reading the page images using olmOCR-2-7B-1025-FP8.
Read off the page by a vision model reading the page images using olmOCR-2-7B-1025-FP8. Translated into 中文 by gpt-5, against glossary version 6. Translated from the English.