2026· International Conference on Principles and Practice of Constraint Programming· pp. 1:1-1:1· 0 citations
Computer Science
TL;DR
The use of decision diagrams are discussed as a compact representation of feasible solutions to constrained optimization problems, where solutions correspond to paths in a layered graph by using relaxed and restricted decision diagrams of bounded size.
A theoretical analysis of the conditions under which LBBD, including cuts, can preserve optimality in the context of Answer Set Programming (ASP), a prominent logic-based language in the field of Artificial Intelligence and introduces a general-purpose algorithm that preserves the optimality guarantees of Bender Decomp...
Carmine Dodaro, Antonio Ielo, M. Maratea et al.· Proceedings of the Thirty-Fi...· 0 citations
The contribution is a proof that there exist measurable versions of intermediate value functions, which reveals regularity in addition, and a verification theorems allow stating traditional problem specifications in the novel setting with mathematical rigor.
Paul Dommel, Alois Pichler· Journal of Convex Analysis· 2 citations
Combinatorial search—finding solutions that meet constraints within an exponentially large space of candidates—underpins problems from hardware verification to scheduling and combinatorial design. The most successful approach in practice is Propositional Satisfiability (SAT) solving, but modelling a problem for a SAT s...
Zi-Yi Yang, Ilya Sergey· Proceedings of the ACM on Pr...· 0 citations
The concept of counterfactual explanations (CEs) has recently gained increasing attention for deriving explanations of mathematical optimization problems. For a given problem, a counterfactual is an ideally minimal change in the mutable problem parameters such that an optimal solution of the changed problem exists fulf...
Marc Goerigk, Jannis Kurtz, Sebastian Merten· 0 citations
Decision diagrams (DDs) have become a powerful tool for discrete optimization, supporting a wide range of algorithms that span cut-generation procedures, decomposition methods, and specialized branch-and-bound searches. Despite this growth, their adoption remains limited, partly because most existing DD code is tailore...
Antonia F. Blanco, Margarita P. Castro, Rodrigo Toro Icarte· 0 citations
Optimization modeling formulates real-world decision problems as mathematical programs that solvers can use to find optimal decisions. Large language models (LLMs) can automate this process, but the resulting correct formulations can require substantial time and memory to construct and solve, limiting practical scalabi...
Zhong Li, Xin Huang, Jin-Hui Wan et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
