返回
Incorporating bounds from decision diagrams into integer programming
DOI:10.1007/s12532-020-00191-6.png)
摘要
En 中文
Decision diagrams have been successfully used to help solve several classes of discrete optimization problems. We explore an approach to incorporate them into integer programming solvers, motivated by the wide adoption of integer programming technology in practice. The main challenge is to map generic integer programming models to a recursive structure that is suitable for decision diagram compilation. We propose a framework that opportunistically constructs decision diagrams for suitable substructures, if present. In particular, we explore the use of a prevalent substructure in integer programming solvers known as the conflict graph, which we show to be amenable to decision diagrams. We use Lagrangian relaxation and constraint propagation to consider constraints that are not represented directly by the substructure. We use the decision diagrams to generate dual and primal bounds to improve the pruning process of the branch-and-bound tree of the solver. Computational results on the independent set problem with side constraints indicate that our approach can provide substantial speedups when conflict graphs are present.
Keyword:
Integer programming
Decision diagrams
Lagrangian relaxation
Conflict graph
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
201
被引数:
1.9K
机构
引用论文
Intermolecular energy transfer between the individual zero-field levels of triplet traps in an orientationally disordered solid三重态陷阱中各向异性固体中单个零场能级间的分子间能量转移
Valoración de limitaciones en reumatología. Herramientas más utilizadas en la práctica风湿病学中的局限性评估。实践中最常用的工具。
Optimised Anaesthesia to Reduce Post Operative Cognitive Decline (POCD) in Older Patients Undergoing Elective Surgery, a Randomised Controlled Trial
PLoS ONE
IF0
Insight into the 6-Thiopurine-Mediated Termination of the Invasive Motility of Tumor Cells Derived from Inflammatory Breast Cancer
Biochemistry
IF0

