Theoretical insights and algorithmic tools for decision diagram-based optimization
From MaRDI portal
Publication:2398513
DOI10.1007/s10601-016-9239-9zbMath1368.90105OpenAlexW2328800137MaRDI QIDQ2398513
Publication date: 16 August 2017
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1807/79265
discrete optimizationconstraint satisfaction problemsdecision diagramsconstraint optimization problems
Related Items (4)
Constraint programming and operations research ⋮ Decision Diagrams for Discrete Optimization: A Survey of Recent Advances ⋮ A Theoretical and Numerical Analysis of the Worst-Case Size of Reduced Ordered Binary Decision Diagrams ⋮ Improving the filtering of branch-and-bound MDD solver
Uses Software
Cites Work
- Lagrangian bounds from decision diagrams
- An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints
- Size of ordered binary decision diagrams representing threshold functions
- Some \(0/1\) polytopes need exponential size extended formulations
- Discrete Optimization with Decision Diagrams
- Optimization Bounds from Binary Decision Diagrams
- Manipulating MDD Relaxations for Combinatorial Optimization
- On Threshold BDDs and the Optimal Variable Ordering Problem
- Cost-Bounded Binary Decision Diagrams for 0-1 Programming
- Graph-Based Algorithms for Boolean Function Manipulation
- Finding the k Shortest Paths
- Branching Programs and Binary Decision Diagrams
- The Matching Polytope has Exponential Extension Complexity
- Decision Diagrams and Dynamic Programming
- Multivalued Decision Diagrams for Sequencing Problems
- Parallel Combinatorial Optimization with Decision Diagrams
- MDD Propagation for Sequence Constraints
- An FPTAS for #Knapsack and Related Counting Problems
- Experimental and Efficient Algorithms
This page was built for publication: Theoretical insights and algorithmic tools for decision diagram-based optimization
