计算机科学
影响图
整数规划
离散优化
约束规划
数学优化
钥匙(锁)
点(几何)
约束(计算机辅助设计)
最优化问题
理论计算机科学
算法
数学
随机规划
人工智能
决策树
几何学
计算机安全
作者
Margarita P. Castro,Andre A. Ciré,J. Christopher Beck
出处
期刊:Informs Journal on Computing
日期:2022-03-22
卷期号:34 (4): 2271-2295
被引量:15
标识
DOI:10.1287/ijoc.2022.1170
摘要
In the last decade, decision diagrams (DDs) have been the basis for a large array of novel approaches for modeling and solving optimization problems. Many techniques now use DDs as a key tool to achieve state-of-the-art performance within other optimization paradigms, such as integer programming and constraint programming. This paper provides a survey of the use of DDs in discrete optimization, particularly focusing on recent developments. We classify these works into two groups based on the type of diagram (i.e., exact or approximate) and present a thorough description of their use. We discuss the main advantages of DDs, point out major challenges, and provide directions for future work.
科研通智能强力驱动
Strongly Powered by AbleSci AI