| dc.contributor | 資科系 | en_US |
| dc.creator (作者) | 陳良弼 | zh_TW |
| dc.creator (作者) | Tseng,Frank S.C.;Yang,Wei-Pang;Chen,Arbee L.P. | en_US |
| dc.date (日期) | 1993-03 | en_US |
| dc.date.accessioned | 28-Aug-2014 10:15:46 (UTC+8) | - |
| dc.date.available | 28-Aug-2014 10:15:46 (UTC+8) | - |
| dc.date.issued (上傳時間) | 28-Aug-2014 10:15:46 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/69389 | - |
| 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.format.extent | 360454 bytes | - |
| dc.format.mimetype | application/pdf | - |
| dc.language.iso | en_US | - |
| dc.relation (關聯) | Computers & Mathematics with Applications,25(5),65-71 | en_US |
| dc.title (題名) | Finding a complete matching with the maximum product on weighted bipartite graphs | en_US |
| dc.type (資料類型) | article | en |
