File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/TENCON.2007.4428865
- Scopus: eid_2-s2.0-48649088635
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Modified bipartite matching for multiobjective optimization
Title | Modified bipartite matching for multiobjective optimization |
---|---|
Authors | |
Keywords | Computers |
Issue Date | 2007 |
Publisher | IEEE. |
Citation | Ieee Region 10 Annual International Conference, Proceedings/Tencon, 2007 How to Cite? |
Abstract | In graph theory, the Hungarian algorithm can provide the maximum weighted bipartite matching for assignment problems. In this paper, a modified bipartite matching (MBM) algorithm is proposed for multiobjective optimization. This algorithm can be widely used to solve the weighted bipartite matching problem with multiobjective optimization. We illustrate the application of MBM to antenna assignments in wireless MIMO system. The simulation results show that MBM enjoys low computational complexity and maximizes the system capacity, while keeping the fairness among mobile users. ©2007 IEEE. |
Persistent Identifier | http://hdl.handle.net/10722/57279 |
ISSN | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Sun, F | en_HK |
dc.contributor.author | Li, VOK | en_HK |
dc.contributor.author | Diao, Z | en_HK |
dc.date.accessioned | 2010-04-12T01:31:38Z | - |
dc.date.available | 2010-04-12T01:31:38Z | - |
dc.date.issued | 2007 | en_HK |
dc.identifier.citation | Ieee Region 10 Annual International Conference, Proceedings/Tencon, 2007 | en_HK |
dc.identifier.issn | 0886-1420 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/57279 | - |
dc.description.abstract | In graph theory, the Hungarian algorithm can provide the maximum weighted bipartite matching for assignment problems. In this paper, a modified bipartite matching (MBM) algorithm is proposed for multiobjective optimization. This algorithm can be widely used to solve the weighted bipartite matching problem with multiobjective optimization. We illustrate the application of MBM to antenna assignments in wireless MIMO system. The simulation results show that MBM enjoys low computational complexity and maximizes the system capacity, while keeping the fairness among mobile users. ©2007 IEEE. | en_HK |
dc.language | eng | en_HK |
dc.publisher | IEEE. | en_HK |
dc.relation.ispartof | IEEE Region 10 Annual International Conference, Proceedings/TENCON | en_HK |
dc.rights | ©2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. | - |
dc.subject | Computers | en_HK |
dc.title | Modified bipartite matching for multiobjective optimization | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0886-1420&volume=&spage=&epage=&date=2007&atitle=Modified+bipartite+matching+for+multiobjective+optimization | en_HK |
dc.identifier.email | Li, VOK:vli@eee.hku.hk | en_HK |
dc.identifier.authority | Li, VOK=rp00150 | en_HK |
dc.description.nature | published_or_final_version | en_HK |
dc.identifier.doi | 10.1109/TENCON.2007.4428865 | en_HK |
dc.identifier.scopus | eid_2-s2.0-48649088635 | en_HK |
dc.identifier.hkuros | 152530 | - |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-48649088635&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.scopusauthorid | Sun, F=8267663500 | en_HK |
dc.identifier.scopusauthorid | Li, VOK=7202621685 | en_HK |
dc.identifier.scopusauthorid | Diao, Z=8415199800 | en_HK |
dc.identifier.issnl | 0886-1420 | - |