首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Pareto optimality in many-to-many matching problems
Institution:1. Institute of Mathematics, Faculty of Science, P.J. Šafárik University, Košice, Slovakia;2. Department of Management Science & Technology, Athens University of Economics and Business, 76 Patission Ave., 104 34 Athens, Greece;3. Budapest University of Technology and Economics Magyar tudósok körútja 2, H-1117, Budapest, Hungary;4. MTA-ELTE Egerváry Research Group, Hungary;5. Department of Informatics, Technological Educational Institute of Athens, Ag. Spyridonos Str., 12210, Egaleo, Greece
Abstract:
Keywords:Matching  Pareto optimality  Serial dictatorship  NP-completeness
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号