THE MINIMAL AVERAGE COST FLOW PROBLEM

NCUIR > School of Management at National Central University > Graduate Institute of Information Management > journal & Dissertation > Item 987654321/29693

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/29693

Title:	THE MINIMAL AVERAGE COST FLOW PROBLEM
Authors:	CHEN,YL
Contributors:	資訊管理研究所
Keywords:	NETWORK FLOW;ALGORITHM
Date:	1995
Issue Date:	2010-06-29 20:38:23 (UTC+8)
Publisher:	中央大學
Abstract:	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.
Relation:	EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Appears in Collections:	[Graduate Institute of Information Management] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	511	View/Open

社群 sharing