File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Modified bipartite matching for multiobjective optimization

TitleModified bipartite matching for multiobjective optimization
Authors
Sun, FLi, VOKDiao, Z
KeywordsComputers
Issue Date2007
PublisherIEEE.
Citation
Ieee Region 10 Annual International Conference, Proceedings/Tencon, 2007 How to Cite?
DOI: http://dx.doi.org/10.1109/TENCON.2007.4428865
AbstractIn 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 Identifierhttp://hdl.handle.net/10722/57279
ISSN
0886-1420
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorSun, Fen_HK
dc.contributor.authorLi, VOKen_HK
dc.contributor.authorDiao, Zen_HK
dc.date.accessioned2010-04-12T01:31:38Z-
dc.date.available2010-04-12T01:31:38Z-
dc.date.issued2007en_HK
dc.identifier.citationIeee Region 10 Annual International Conference, Proceedings/Tencon, 2007en_HK
dc.identifier.issn0886-1420en_HK
dc.identifier.urihttp://hdl.handle.net/10722/57279-
dc.description.abstractIn 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.languageengen_HK
dc.publisherIEEE.en_HK
dc.relation.ispartofIEEE Region 10 Annual International Conference, Proceedings/TENCONen_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.subjectComputersen_HK
dc.titleModified bipartite matching for multiobjective optimizationen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0886-1420&volume=&spage=&epage=&date=2007&atitle=Modified+bipartite+matching+for+multiobjective+optimizationen_HK
dc.identifier.emailLi, VOK:vli@eee.hku.hken_HK
dc.identifier.authorityLi, VOK=rp00150en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/TENCON.2007.4428865en_HK
dc.identifier.scopuseid_2-s2.0-48649088635en_HK
dc.identifier.hkuros152530-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-48649088635&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.scopusauthoridSun, F=8267663500en_HK
dc.identifier.scopusauthoridLi, VOK=7202621685en_HK
dc.identifier.scopusauthoridDiao, Z=8415199800en_HK
dc.identifier.issnl0886-1420-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats