Theoretical insights and algorithmic tools for decision diagram-based optimization
From MaRDI portal
Recommendations
- Decision diagrams for optimization
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
- Discrete optimization with decision diagrams
- Optimization Bounds from Binary Decision Diagrams
- Optimal decision processes and algorithms
- Optimization bounds from decision diagrams in Haddock
- Decision diagrams and dynamic programming
- Graph‐Related Optimization and Decision Support Systems
- scientific article; zbMATH DE number 1391431
Cites work
- An FPTAS for #Knapsack and Related Counting Problems
- An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints
- Branching Programs and Binary Decision Diagrams
- Cost-Bounded Binary Decision Diagrams for 0-1 Programming
- Decision diagrams and dynamic programming
- Discrete optimization with decision diagrams
- Experimental and Efficient Algorithms
- Finding the k Shortest Paths
- Graph-Based Algorithms for Boolean Function Manipulation
- Lagrangian bounds from decision diagrams
- Manipulating MDD relaxations for combinatorial optimization
- MDD propagation for sequence constraints
- Multivalued decision diagrams for sequencing problems
- On Threshold BDDs and the Optimal Variable Ordering Problem
- Optimization Bounds from Binary Decision Diagrams
- Parallel Combinatorial Optimization with Decision Diagrams
- Size of ordered binary decision diagrams representing threshold functions
- Some \(0/1\) polytopes need exponential size extended formulations
Cited in
(16)- Constraint programming and operations research
- Outer approximation for integer nonlinear programs via decision diagrams
- Improving the filtering of branch-and-bound MDD solver
- Strong relaxations for continuous nonlinear programs based on decision diagrams
- Discrete optimization with decision diagrams
- Decomposition based on decision diagrams
- Manipulating MDD relaxations for combinatorial optimization
- Decision diagrams for optimization
- A theoretical and numerical analysis of the worst-case size of reduced ordered binary decision diagrams
- Decision Diagram Decomposition for Quadratically Constrained Binary Optimization
- Improving variable orderings of approximate decision diagrams using reinforcement learning
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
- On the consistent path problem
- Interactive Cost Configuration Over Decision Diagrams
- On the Structure of Decision Diagram–Representable Mixed-Integer Programs with Application to Unit Commitment
- Incorporating bounds from decision diagrams into integer programming
This page was built for publication: Theoretical insights and algorithmic tools for decision diagram-based optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2398513)
