Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems - 8th International Conference, CPAIOR 2011, Berlin, Germany, May 23-27, 2011. Proceedings
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems - 8th International Conference, CPAIOR 2011, Berlin, Germany, May 23-27, 2011. Proceedings
复制标题
组合优化问题约束规划中的 AI 和 OR 技术的集成 - 第 8 届国际会议，CPAIOR 2011，德国柏林，2011 年 5 月 23-27 日。
DOI：
10.1007/978-3-642-21311-3_4
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
Aschinger M
中科院分区：
文献类型：
--
作者：
Aschinger M
在这项工作中，我们把伙伴单位问题作为优化方法的一个新的挑战。它捕获了行业中经常出现的特定类型的配置问题。不幸的是，可以证明，在最一般的情况下，问题的优化版本是难以处理的。我们在答案集编程、命题可满足性测试、约束求解和整数规划的框架下提出并评估了问题的编码。我们还展示了如何使这些编码适应一类问题实例，我们最近已经证明这些问题实例是容易处理的。
In this work we present the Partner Units Problem as a novel challenge for optimization methods. It captures a certain type of configuration problem that frequently occurs in industry. Unfortunately, it can be shown that in the most general case an optimization version of the problem is intractable. We present and evaluate encodings of the problem in the frameworks of answer set programming, propositional satisfiability testing, constraint solving, and integer programming. We also show how to adapt these encodings to a class of problem instances that we have recently shown to be tractable.