作者： B Rothschild , A Whinston , PURDUE UNIV LAFAYETTE IND KRANNERT GRADUATE SCHOOL OF INDUSTRIAL ADMINISTRATION
DOI:
关键词: Linear programming 、 Flow network 、 Structure (category theory) 、 Mathematical optimization 、 Mathematical economics 、 Multi-commodity flow problem 、 Current (mathematics) 、 Computation 、 Commodity (Marxism) 、 Computer science 、 Flow (mathematics)
摘要: Abstract : The purpose of this article is to survey the current literature on multicommodity network flows. study flows concerned with generalizing results which are known for single commodity in networks. These fall into three broad categories: optimization, computation and structure. optimization category includes question maximizing flow or minimizing cost a network. involves finding algorithms efficiently computing And structural relate properties (e.g., Max-flow Min-cut Theorem). Because added complexity having many commodities, sometimes require methods different from those used analogous results. As one-commodity case, maximal can be stated as linear programming problem. In general n-commodity there feasibility. That is, not only do we wish know how much achieved, but more specifically each kind commodity. (Author)