Cost-Bounded Binary Decision Diagrams for 0-1 Programming

DOI10.1007/978-3-540-72397-4_7MaRDI QIDQ3612409zbMATH OpenOpenAlexFDO

Authors Tarik Hadžić, John N. Hooker

Publication date 10 March 2009

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72397-4_7

Mathematics Subject Classification ID

Boolean programming (90C09)

Recommendations

• Optimization Bounds from Binary Decision Diagrams
• Experimental and Efficient Algorithms
• Discrete optimization with decision diagrams
• BDDs -- design, analysis, complexity, and applications.
• On Threshold BDDs and the Optimal Variable Ordering Problem

Cited in

(15)

• Theoretical insights and algorithmic tools for decision diagram-based optimization
• Optimization Bounds from Binary Decision Diagrams
• Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems
• scientific article; zbMATH DE number 6999904 (Why is no real title available?)
• A constraint programming based column generation approach to nurse rostering problems
• Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression
• Stochastic decision diagrams
• Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
• Discrete optimization with decision diagrams
• On the consistent path problem
• Fast enumeration of all cost-bounded solutions for combinatorial problems using ZDDs
• SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
• Chain reduction for binary and zero-suppressed decision diagrams
• Postoptimal Analysis in Nonserial Dynamic Programming
• Experimental and Efficient Algorithms

This page was built for publication: Cost-Bounded Binary Decision Diagrams for 0-1 Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3612409)