MULTICOMMODITY NETWORK FLOWS WITH SAFETY CONSIDERATIONS

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

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

题名:	MULTICOMMODITY NETWORK FLOWS WITH SAFETY CONSIDERATIONS
作者:	CHEN,YL;CHIN,YH
贡献者:	資訊管理研究所
日期:	1992
上传时间:	2010-06-29 20:38:32 (UTC+8)
出版者:	中央大學
摘要:	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.
關聯:	OPERATIONS RESEARCH
显示于类别:	[資訊管理研究所] 期刊論文

文件中的档案:

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

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

社群 sharing