Decision Diagrams for Discrete Optimization: A Survey of Recent Advances Article Swipe

PDF

Related Concepts

Computer science Integer programming Discrete optimization Influence diagram Key (lock) Point (geometry) Constraint programming Constraint (computer-aided design) Mathematical optimization Optimization problem Diagram Theoretical computer science Management science Operations research Algorithm Artificial intelligence Stochastic programming Mathematics Decision tree Engineering Computer security Geometry Database

Margarita P. Castro , André A. Ciré , J. Christopher Beck ·

YOU? · · 2022 · Open Access · · DOI: https://doi.org/10.48550/arxiv.2201.11536 · OA: W4226079167

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.