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

被引：0
|
作者：
TSENG, FSC
YANG, WP
CHEN, ALP
机构：
[1] NATL TSING HUA UNIV,DEPT COMP SCI,HSINCHU 30043,TAIWAN
[2] NATL CHIAO TUNG UNIV,DEPT COMP SCI & INFORMAT ENGN,HSINCHU 30050,TAIWAN
来源：
COMPUTERS & MATHEMATICS WITH APPLICATIONS | 1993年 / 25卷 / 05期
关键词：
D O I：
10.1016/0898-1221(93)90199-6
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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.
引用
收藏
页码：65 / 71
页数：7
相关论文
共 50 条
12345