.png){kind=icon}
返回
Parliament seating assignment problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2021.08.002.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Motivated by evidence that parliament seatings are relevant for decision making, we consider the problem to assign seats in a parliament to members of parliament. We prove that the resulting seating assignment problem is strongly NP-hard in several restricted settings. We present a Mixed Integer Programming formulation of the problem, we describe two families of valid inequalities and we discuss symmetry breaking constraints. Further, we design a heuristic. Finally, we compare the outcomes of the Mixed Integer Programming formulation with the outcomes of the heuristic in a computational study. (c) 2021 Elsevier B.V. All rights reserved.
Keyword:
Combinatorial optimization
Complexity theory
Heuristics
Valid inequalities
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
7.6W
机构
引用论文
Bioactive ingredients and microbial diversity of Fuzhuan tea produced from different raw materials.茯砖茶中活性成分及由不同原料生产的微生物多样性。.png)
IF0
PREAI
分享收藏
查看更多内容