Optimization Bounds from Binary Decision Diagrams
From MaRDI portal
Publication:2962554
DOI10.1287/ijoc.2013.0561zbMath1356.90083OpenAlexW3123057019MaRDI QIDQ2962554
No author found.
Publication date: 17 February 2017
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/163c5e18b29a577a496f54a02548068d16d069c3
Related Items
Constraint programming and operations research ⋮ Incorporating bounds from decision diagrams into integer programming ⋮ Graph Coloring Lower Bounds from Decision Diagrams ⋮ Improving Variable Orderings of Approximate Decision Diagrams Using Reinforcement Learning ⋮ Variable ordering for decision diagrams: a portfolio approach ⋮ Theoretical insights and algorithmic tools for decision diagram-based optimization ⋮ Stochastic decision diagrams ⋮ Oblivious bounds on the probability of boolean functions ⋮ Lagrangian bounds from decision diagrams ⋮ Characteristics of the maximal independent set ZDD ⋮ Decision Diagrams for Discrete Optimization: A Survey of Recent Advances ⋮ Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem ⋮ Target Cuts from Relaxed Decision Diagrams ⋮ Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams ⋮ 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 ⋮ Discrete Optimization with Decision Diagrams ⋮ Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams ⋮ Decision Diagram Decomposition for Quadratically Constrained Binary Optimization ⋮ Compiling CP subproblems to MDDs and d-DNNFs ⋮ 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
Uses Software
Cites Work
- A branch and cut solver for the maximum stable set problem
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
- Manipulating MDD Relaxations for Combinatorial Optimization
- Graph-Based Algorithms for Boolean Function Manipulation
- Binary Decision Diagrams
- Improving the variable ordering of OBDDs is NP-complete
- Branching Programs and Binary Decision Diagrams
- A tutorial on branch and cut algorithms for the maximum stable set problem
- Decision Diagrams and Dynamic Programming
- Experimental and Efficient Algorithms
- A branch-and-cut algorithm for the maximum cardinality stable set problem
