登入選單
返回Google圖書搜尋
Feasibility of Two Commodity Network Flows
註釋The paper considers the problem of feasibility of integer flows in a two commodity network with integral capacities. The main result of the paper is conditions under which, for two nonnegative integers a and b, there exists a two commodity flow, where the flow of the first commodity is of size a and the second flow of size b. If such numbers are realizable as flow values, then an algorithm is indicated for finding the actual paths in the network. (Author).