Cost-Bounded Binary Decision Diagrams for 0-1 Programming

Authors:
Tarik Hadžić;J. N. Hooker
Affiliations:
IT University of Copenhagen,;Carnegie Mellon University,
Venue:
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Year:
2007

Citing 7
Cited 2

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Symbolic Boolean manipulation with ordered binary-decision diagrams

ACM Computing Surveys (CSUR)
Logic-based 0-1 constraint programming

Logic-based 0-1 constraint programming
Size of ordered binary decision diagrams representing threshold functions

Theoretical Computer Science
Binary Decision Diagrams

IEEE Transactions on Computers
A BDD-based polytime algorithm for cost-bounded interactive configuration

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
BDDs in a branch and cut framework

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms

Approximate Compilation of Constraints into Multivalued Decision Diagrams

CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
BDD-based heuristics for binary optimization

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller BDDs can be used for the same analysis by employing cost bounding techniques in their construction.