arXiv Analytics

Sign in

arXiv:2201.11536 [math.OC]AbstractReferencesReviewsResources

Decision Diagrams for Discrete Optimization: A Survey of Recent Advances

Margarita P. Castro, Andre A. Cire, J. Christopher Beck

Published 2022-01-27Version 1

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.

Related articles: Most relevant | Search more
arXiv:2409.01373 [math.OC] (Published 2024-09-02)
Quantum Computing for Discrete Optimization: A Highlight of Three Technologies
arXiv:2312.01404 [math.OC] (Published 2023-12-03)
Decision Diagrams in Space!
arXiv:2407.18111 [math.OC] (Published 2024-07-25)
Job Shop Scheduling with Integer Programming, Shifting Bottleneck, and Decision Diagrams: A Computational Study