A PARAMETRIC MAXIMUM FLOW ALGORITHM FOR BIPARTITE GRAPHS WITH APPLICATIONS

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

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

题名:	A PARAMETRIC MAXIMUM FLOW ALGORITHM FOR BIPARTITE GRAPHS WITH APPLICATIONS
作者:	CHEN,YL
贡献者:	資訊管理研究所
关键词:	NETWORK FLOW
日期:	1995
上传时间:	2010-06-29 20:38:16 (UTC+8)
出版者:	中央大學
摘要:	Suppose we are given a capacitated bipartite network G with node sets S and T. In network G, the arc capacities are not fixed values but are functions of a single parameter lambda, where lambda is a continuous real variable. Our problem is to determine the minimum value of lambda such that the maximum flow value in the corresponding network equals a given threshold. For this problem, an algorithm of time complexity O(nm(2) log(m/n)) is presented, where n is the number of nodes in S, m is the number of nodes in T and n less than or equal to m. Examples are then given to show how to use this parametric algorithm to solve practical problems.
關聯:	EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
显示于类别:	[資訊管理研究所] 期刊論文

文件中的档案:

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

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

社群 sharing