An Innovative Approach for Solving Maximal-Flow Problems

Please use this identifier to cite or link to this item: http://inet.vidyasagar.ac.in:8080/jspui/handle/123456789/879

Full metadata record

DC Field	Value	Language
dc.contributor.author	Khan, Md. Al-Amin
dc.contributor.author	Rashid, Abdur
dc.contributor.author	Khan, Aminur Rahman
dc.contributor.author	Uddin, Md Sharif
dc.date.accessioned	2016-12-22T17:31:04Z	-
dc.date.available	2016-12-22T17:31:04Z	-
dc.date.issued	2013-12-26
dc.identifier.issn	0972-8791
dc.identifier.uri	http://inet.vidyasagar.ac.in:8080/jspui/handle/123456789/879	-
dc.description.abstract	This paper aims at introducing a new approach for finding the maximum flow of a maximal- flow problem requiring less number of iterations and less augmentation than Ford-Fulkerson algorithm. To illustrate the proposed method, a numerical example is presented. We have also formulated the maximal-flow problem as a linear programming problem (LPP) and solved it by using Bounded Variable Simplex Method	en_US
dc.language.iso	en_US	en_US
dc.publisher	Vidyasagar University , Midnapore , West-Bengal , India	en_US
dc.relation.ispartofseries	Journal of Physical Science;17
dc.subject	Maximal-Flow Model	en_US
dc.subject	Residual network	en_US
dc.subject	Source-Sink cut	en_US
dc.subject	Source-Sink cut capacity	en_US
dc.subject	Bounded variable simplex method	en_US
dc.title	An Innovative Approach for Solving Maximal-Flow Problems	en_US
dc.type	Article	en_US
Appears in Collections:	Journal of Physical Sciences Vol.17 [2013]

Files in This Item:

File	Description	Size	Format
JPS-v17-13.pdf		219.68 kB	Adobe PDF	View/Open

DSpace JSPUI