A PARAMETRIC MAXIMUM FLOW ALGORITHM FOR BIPARTITE GRAPHS WITH APPLICATIONS

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

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

Title:	A PARAMETRIC MAXIMUM FLOW ALGORITHM FOR BIPARTITE GRAPHS WITH APPLICATIONS
Authors:	CHEN,YL
Contributors:	資訊管理研究所
Keywords:	NETWORK FLOW
Date:	1995
Issue Date:	2010-06-29 20:38:16 (UTC+8)
Publisher:	中央大學
Abstract:	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.
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	399	View/Open

社群 sharing