Access the full text.
Sign up today, get DeepDyve free for 14 days.
M. Henk, M. Köppe, R. Weismantel (2003)
Integral decomposition of polyhedra and some applications in mixed integer programmingMathematical Programming, 94
S. Kluge (2016)
Algorithms And Data Structures In Vlsi Design Obdd Foundations And Applications
(1996)
Clique, Coloring, and Satisfiability: Second DIMACS Implementation Challenge
P. Flajolet, Éric Fusy, Carine Pivoteau (2007)
Boltzmann sampling of unlabelled structures
David Bergman, A. Ciré, W. Hoeve, J. Hooker (2012)
Variable Ordering for the Application of BDDs to the Maximum Independent Set Problem
Steiner triple covering problem instances SBCL community : Sbcl 1 . 1 . 5 , an implementation of ANSI Common Lisp
A. Schrijver (1990)
A Course in Combinatorial Optimization
S Hoda, WJ van Hoeve, J Hooker (2010)
Principles and Practice of Constraint Programming – CP 2010, Lecture Notes in Computer Science, vol. 6308
E. Amaldi, S. Bosio, F. Malucelli (2012)
Hyperbolic set covering problems with competing ground-set elementsMathematical Programming, 134
K Sekine, H Imai, S Tani (1995)
Algorithms and Computations, Lecture Notes in Computer Science, vol. 1004
K. Sekine, H. Imai, S. Tani (1995)
Computing the Tutte Polynomial of a Graph of Moderate Size
Sofia Cassel (2012)
Graph-Based Algorithms for Boolean Function Manipulation
A. Frieze, J. Yadegar (1983)
On the quadratic assignment problemDiscret. Appl. Math., 5
P. Flajolet, Éric Fusy, Carine Pivoteau (2007)
Boltzmann Sampling of Unlabeled Structures
David Bergman, W. Hoeve, J. Hooker (2011)
Manipulating MDD Relaxations for Combinatorial Optimization
David Johnson, M. Trick (1996)
Cliques, Coloring, and Satisfiability, 26
David Bergman, A. Ciré, W. Hoeve, Tallys Yunes (2014)
BDD-based heuristics for binary optimizationJournal of Heuristics, 20
W. Cook, W. Cunningham, W. Pulleyblank, A. Schrijver (1997)
Combinatorial optimization
H. Hamacher, M. Queyranne (1985)
K best solutions to combinatorial optimization problemsAnnals of Operations Research, 4
Prof. Meinel, D. Theobald (1998)
Algorithms and Data Structures in VLSI Design
D Bergman, WJ van Hoeve, JN Hooker (2011)
Manipulating MDD relaxations for combinatorial optimization. In: Proceedings of the 8th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR’11
Frank Zeeuw (2016)
Graph Theory
F. Yao (1979)
Graph 2-Isomorphism is NP-CompleteInf. Process. Lett., 9
C. Lee (1959)
Representation of switching circuits by binary-decision programsBell System Technical Journal, 38
E. Cuthill, J. McKee (1969)
Reducing the bandwidth of sparse symmetric matrices
U. Haus, M. Köppe, R. Weismantel (2003)
A primal all-integer algorithm based on irreducible solutionsMathematical Programming, 96
S. Hoda, W. Hoeve, J. Hooker (2010)
A Systematic Approach to MDD-Based Constraint Programming
D Bergman, AA Cire, WJ van Hoeve, JN Hooker (2012)
Variable ordering for the application of BDDs to the maximum independent set problem. In: Proceedings of the 9th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR’12
It is well known that (reduced, ordered) binary decision diagrams (BDDs) can sometimes be compact representations of the full solution set of Boolean optimization problems. Recently they have been suggested to be useful as discrete relaxations in integer and constraint programming (Hoda et al. 2010). We show that for every independence system there exists a top-down (i.e., single-pass) construction rule for the BDD. Furthermore, for packing and covering problems on n variables whose bandwidth is bounded by O ( log n ) $\mathcal {O}(\log n)$ the maximum width of the BDD is bounded by O ( n ) $\mathcal {O}(n)$ . We also characterize minimal widths of BDDs representing the set of all solutions to a stable set problem for various basic classes of graphs. Besides implicitly enumerating or counting all solutions and optimizing a class of nonlinear objective functions that includes separable functions, the results can be applied for effective evaluation of generating functions.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Mar 11, 2016
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.