登入
選單
返回
Google圖書搜尋
On Two Commodity Network Flows
Irtiz̤á Karīm
Andrew B. Whinston
出版
University of Virginia, Department of Economics
, 1965
URL
http://books.google.com.hk/books?id=BBbKNwAACAAJ&hl=&source=gbs_api
註釋
The paper considers the problem of two-commodity network flows and generalizes a result of Hu on integral flows in networks with integral capacities. The main result of the paper is a Max-flow Min-cut theorem for two commodity networks. The method of proof involves a particular type of separation process. This leads to an algorithm for finding the maximal flows. Several counterexamples to certain possible generalizations are given at the end of the paper. (Author).
