MULTICOMMODITY NETWORK FLOWS WITH SAFETY CONSIDERATIONS

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

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

Title:	MULTICOMMODITY NETWORK FLOWS WITH SAFETY CONSIDERATIONS
Authors:	CHEN,YL;CHIN,YH
Contributors:	資訊管理研究所
Date:	1992
Issue Date:	2010-06-29 20:38:32 (UTC+8)
Publisher:	中央大學
Abstract:	Previous research on the multicommodity minimum cost flow problem (MMCFP) has assumed that there are two types of values associated with an arc. The first is the capacity of the arc and the second is the unit flow cost along the arc. This paper adds the third attribute-the degree of difficulty-into the conventional model of the MMCFP. In this way, a new problem, which is more general and difficult than the conventional MMCFP, is formed. However, we show that these two problems are indeed polynomially equivalent. With the equivalence, the techniques developed for solving the conventional MMCFP can be used to solve the new but more general problem.
Relation:	OPERATIONS RESEARCH
Appears in Collections:	[Graduate Institute of Information Management] journal & Dissertation

Files in This Item:

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

社群 sharing