Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Entire DC Network
A Systematic Approach To Mdd-Based Constraint Programming, Samid Hoda, Willem-Jan Van Hoeve, John N. Hooker
A Systematic Approach To Mdd-Based Constraint Programming, Samid Hoda, Willem-Jan Van Hoeve, John N. Hooker
John Hooker
Fixed-width MDDs were introduced recently as a more refined alternative for the domain store to represent partial solutions to CSPs. In this work, we present a systematic approach to MDD-based constraint programming. First, we introduce a generic scheme for constraint propagation in MDDs. We show that all previously known propagation algorithms for MDDs can be expressed using this scheme. Moreover, we use the scheme to produce algorithms for a number of other constraints, including Among, Element, and unary resource constraints. Finally, we discuss an implementation of our MDD-based CP solver, and provide experimental evidence of the benefits of MDD-based constraint …
Postoptimality Analysis For Integer Programming Using Binary Decision Diagrams, Tarik Hadzic, John N. Hooker
Postoptimality Analysis For Integer Programming Using Binary Decision Diagrams, Tarik Hadzic, John N. Hooker
John Hooker
We show how binary decision diagrams (BDDs) can be used to solve and obtain postoptimality analysis for linear and nonlinear integer programming problems with binary or general integer variables. The constraint set corresponds to a unique reduced BDD that represents all feasible or near-optimal solutions, and in which optimal solutions correspond to certain shortest paths. The BDD can be queried in real time for in-depth postoptimality reasoning. The approach is equally effective for linear and nonlinear problems. There are currently no other methods for obtaining such an analysis, short of repeatedly re-solving the problem. We illustrate the analysis on capital …