The minimal average cost flow problem

研究成果: 雜誌貢獻期刊論文同行評審

5 引文 斯高帕斯(Scopus)


Given a network with flow costs and arc capacities, the classical min-cost flow problem is to send a given amount of flow from the source node to the sink node at least cost. This paper proposes a new variant of the min-cost flow problem by including a fixed cost into the model and by changing the goal as to minimize the average cost. In other words, we assume that the total cost includes two terms: one is the fixed cost of using the network to send flow; the other is a variable cost per unit of flow on the arc. Under this cost assumption, our goal is to minimize the average cost of sending flow. This paper develops an efficient algorithm for this problem.

頁(從 - 到)561-570
期刊European Journal of Operational Research
出版狀態已出版 - 16 3月 1995


深入研究「The minimal average cost flow problem」主題。共同形成了獨特的指紋。