.png){kind=icon}
返回
Partial hyperplane activation for generalized intersection cuts
.png){kind=icon}
PRE
AI
DOI：10.1007/s12532-019-00166-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The generalized intersection cut paradigm is a recent framework for generating cutting planes in mixed integer programming with attractive theoretical properties. We investigate this computationally unexplored paradigm and observe that a key hyperplane activation procedure embedded in it is not computationally viable. To overcome this issue, we develop a novel replacement to this procedure called partial hyperplane activation (PHA), introduce a variant of PHA based on a notion of hyperplane tilting, and prove the validity of both algorithms. We propose several implementation strategies and parameter choices for our PHA algorithms and provide supporting theoretical results. We computationally evaluate these ideas in the COIN-OR framework on MIPLIB instances. Our findings shed light on the the strengths of the PHA approach as well as suggest properties related to strong cuts that can be targeted in the future.
Keyword:
Mixed-integer linear programming
Cutting planes
Intersection cuts
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
198
被引数:
1.9K
机构
引用论文
.png){kind=icon}
分享收藏分享收藏
分享收藏分享收藏分享收藏分享收藏分享收藏分享收藏分享收藏
分享收藏
查看更多内容