Theoretical insights and algorithmic tools for decision diagram-based optimization
From MaRDI portal
Publication:2398513
DOI10.1007/S10601-016-9239-9zbMATH Open1368.90105OpenAlexW2328800137MaRDI QIDQ2398513FDOQ2398513
Authors: Yanyan Li 
Publication date: 16 August 2017
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1807/79265
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
- Publication:4936002
constraint satisfaction problemsdiscrete optimizationdecision diagramsconstraint optimization problems
Cites Work
- On Threshold BDDs and the Optimal Variable Ordering Problem
- Graph-Based Algorithms for Boolean Function Manipulation
- Finding the k Shortest Paths
- Discrete optimization with decision diagrams
- Manipulating MDD relaxations for combinatorial optimization
- Branching Programs and Binary Decision Diagrams
- Multivalued decision diagrams for sequencing problems
- Parallel Combinatorial Optimization with Decision Diagrams
- 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
- The Matching Polytope has Exponential Extension Complexity
- Some \(0/1\) polytopes need exponential size extended formulations
- Cost-Bounded Binary Decision Diagrams for 0-1 Programming
- Optimization Bounds from Binary Decision Diagrams
- Decision diagrams and dynamic programming
- MDD propagation for sequence constraints
- Size of ordered binary decision diagrams representing threshold functions
- Experimental and Efficient Algorithms
- Lagrangian bounds from decision diagrams
Cited In (14)
- Incorporating bounds from decision diagrams into integer programming
- Constraint programming and operations research
- Improving variable orderings of approximate decision diagrams using reinforcement learning
- Decomposition based on decision diagrams
- Outer approximation for integer nonlinear programs via decision diagrams
- Manipulating MDD relaxations for combinatorial optimization
- A theoretical and numerical analysis of the worst-case size of reduced ordered binary decision diagrams
- On the Structure of Decision Diagram–Representable Mixed-Integer Programs with Application to Unit Commitment
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
- Discrete optimization with decision diagrams
- Decision diagrams for optimization
- On the consistent path problem
- Improving the filtering of branch-and-bound MDD solver
- Interactive Cost Configuration Over Decision Diagrams
Uses Software
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)
