FINDING A COMPLETE MATCHING WITH THE MAXIMUM PRODUCT ON WEIGHTED BIPARTITE GRAPHS

Full metadata record

DC Field	Value	Language
dc.contributor.author	TSENG, FSC	en_US
dc.contributor.author	YANG, WP	en_US
dc.contributor.author	CHEN, ALP	en_US
dc.date.accessioned	2014-12-08T15:04:36Z	-
dc.date.available	2014-12-08T15:04:36Z	-
dc.date.issued	1993-03-01	en_US
dc.identifier.issn	0898-1221	en_US
dc.identifier.uri	http://hdl.handle.net/11536/3101	-
dc.description.abstract	The traditional bipartite weighted matching problem is to maximize the largest possible sum of weights. In this paper, we define a bipartite matching problem which maximizes the largest possible product of weights and develop an algorithm to solve it. Although this problem corresponds to a non-linear program, we show this problem can be easily solved by modifying the Hungarian method. Finally, we present an application of this problem.	en_US
dc.language.iso	en_US	en_US
dc.title	FINDING A COMPLETE MATCHING WITH THE MAXIMUM PRODUCT ON WEIGHTED BIPARTITE GRAPHS	en_US
dc.type	Article	en_US
dc.identifier.journal	COMPUTERS & MATHEMATICS WITH APPLICATIONS	en_US
dc.citation.volume	25	en_US
dc.citation.issue	5	en_US
dc.citation.spage	65	en_US
dc.citation.epage	71	en_US
dc.contributor.department	資訊工程學系	zh_TW
dc.contributor.department	Department of Computer Science	en_US
dc.identifier.wosnumber	WOS:A1993KJ86700007	-
dc.citation.woscount	0	-
Appears in Collections:	Articles

Files in This Item:

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.