Decision diagrams for discrete optimization: A survey of recent advances
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 …
approaches for modeling and solving optimization problems. Many techniques now use DDs …
Peel-and-bound: Generating stronger relaxed bounds with multivalued decision diagrams
Decision diagrams are an increasingly important tool in cutting-edge solvers for discrete
optimization. However, the field of decision diagrams is relatively new, and is still …
optimization. However, the field of decision diagrams is relatively new, and is still …
Improved Peel-and-Bound: Methods for generating dual bounds with multivalued decision diagrams
Decision diagrams are an increasingly important tool in cutting-edge solvers for discrete
optimization. However, the field of decision diagrams is relatively new, and is still …
optimization. However, the field of decision diagrams is relatively new, and is still …
Domain-independent dynamic programming
R Kuroiwa - 2024 - search.proquest.com
Dynamic programming (DP) is a framework used in multiple disciplines to solve decision-
making problems. In particular, in computer science and operations research (OR), DP …
making problems. In particular, in computer science and operations research (OR), DP …
Boosting Decision Diagram-Based Branch-And-Bound by Pre-Solving with Aggregate Dynamic Programming
Discrete optimization problems expressible as dynamic programs can be solved by branch-
and-bound with decision diagrams. This approach dynamically compiles bounded-width …
and-bound with decision diagrams. This approach dynamically compiles bounded-width …
Efficient encoding of cost optimal delete-free planning as SAT
MF Rankooh, J Rintanen - Proceedings of the AAAI Conference on …, 2022 - ojs.aaai.org
We introduce a novel method for encoding cost optimal delete-free STRIPS Planning as
SAT. Our method is based on representing relaxed plans as partial functions from the set of …
SAT. Our method is based on representing relaxed plans as partial functions from the set of …
CODD: A Decision Diagram-Based Solver for Combinatorial Optimization
L Michel, WJ van Hoeve - ECAI 2024, 2024 - ebooks.iospress.nl
We introduce CODD, a system for solving combinatorial optimization problems using
decision diagram technology. Problems are represented as state-based dynamic …
decision diagram technology. Problems are represented as state-based dynamic …
Efficient computation and informative estimation of h+ by integer and linear programming
MF Rankooh, J Rintanen - Proceedings of the International Conference …, 2022 - ojs.aaai.org
We investigate modeling cost optimal delete-free STRIPS Planning by Integer/Linear
Programming (IP/LP). We introduce two IP models and their LP relaxations based on a …
Programming (IP/LP). We introduce two IP models and their LP relaxations based on a …
[PDF][PDF] Vianney Coppé
On top of their use for Boolean encodings [27], formal verification [25], model checking 30
[15], computer-aided design [29] and much more, decision diagrams (DDs) have recently 31 …
[15], computer-aided design [29] and much more, decision diagrams (DDs) have recently 31 …
[图书][B] Optimization methods based on decision diagrams for constraint programming, AI planning, and mathematical programming
MP Castro - 2021 - search.proquest.com
Decision diagrams (DDs) are graphical structures that can be used to solve discrete
optimization problems by representing the set of feasible solutions as paths in a graph. This …
optimization problems by representing the set of feasible solutions as paths in a graph. This …