THE MINIMAL AVERAGE COST FLOW PROBLEM

NCU Institutional Repository > 管理學院 > 資訊管理研究所 > 期刊論文 > Item 987654321/29693

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/29693

题名:	THE MINIMAL AVERAGE COST FLOW PROBLEM
作者:	CHEN,YL
贡献者:	資訊管理研究所
关键词:	NETWORK FLOW;ALGORITHM
日期:	1995
上传时间:	2010-06-29 20:38:23 (UTC+8)
出版者:	中央大學
摘要:	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.
關聯:	EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
显示于类别:	[資訊管理研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
index.html		0Kb	HTML	511	检视/开启

在NCUIR中所有的数据项都受到原著作权保护.

社群 sharing