Optimization Bounds from Binary Decision Diagrams
From MaRDI portal
Recommendations
- Optimization bounds from decision diagrams in Haddock
- Lagrangian bounds from decision diagrams
- Cost-Bounded Binary Decision Diagrams for 0-1 Programming
- Decision Diagram Decomposition for Quadratically Constrained Binary Optimization
- Exact minimization of binary decision diagrams using implicit techniques
- On the minimization of (complete) ordered binary decision diagrams
- On the complexity of constructing optimal ordered binary decision diagrams
- scientific article; zbMATH DE number 1543030
- Incorporating bounds from decision diagrams into integer programming
Cites work
- A branch and cut solver for the maximum stable set problem
- A branch-and-cut algorithm for the maximum cardinality stable set problem
- A tutorial on branch and cut algorithms for the maximum stable set problem
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- Binary Decision Diagrams
- Branching Programs and Binary Decision Diagrams
- Decision diagrams and dynamic programming
- Experimental and Efficient Algorithms
- Graph-Based Algorithms for Boolean Function Manipulation
- Improving the variable ordering of OBDDs is NP-complete
- Manipulating MDD relaxations for combinatorial optimization
Cited in
(34)- Constraint programming and operations research
- On finding the optimal BDD relaxation
- Outer approximation for integer nonlinear programs via decision diagrams
- \(\mathrm{A}^*\)-based construction of decision diagrams for a prize-collecting scheduling problem
- A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem
- Improving the filtering of branch-and-bound MDD solver
- Graph coloring with decision diagrams
- Variable ordering for decision diagrams: a portfolio approach
- Stochastic decision diagrams
- Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem
- Compiling CP subproblems to MDDs and d-DNNFs
- Theoretical insights and algorithmic tools for decision diagram-based optimization
- BDD-based optimization for the quadratic stable set problem
- Discrete optimization with decision diagrams
- Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams
- Decomposition based on decision diagrams
- Oblivious bounds on the probability of boolean functions
- Manipulating MDD relaxations for combinatorial optimization
- Decision diagrams for optimization
- Cost-Bounded Binary Decision Diagrams for 0-1 Programming
- Characteristics of the maximal independent set ZDD
- Decision Diagram Decomposition for Quadratically Constrained Binary Optimization
- Graph coloring lower bounds from decision diagrams
- Improving variable orderings of approximate decision diagrams using reinforcement learning
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
- Compact representations of all members of an independence system
- Target cuts from relaxed decision diagrams
- scientific article; zbMATH DE number 6292613 (Why is no real title available?)
- Experimental and Efficient Algorithms
- Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams
- Tight upper and lower bounds for the quadratic knapsack problem through binary decision diagrams
- Heuristic multiobjective discrete optimization using restricted decision diagrams
- Incorporating bounds from decision diagrams into integer programming
- Lagrangian bounds from decision diagrams
This page was built for publication: Optimization Bounds from Binary Decision Diagrams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2962554)
