Manipulating MDD Relaxations for Combinatorial Optimization
DOI10.1007/978-3-642-21311-3_5zbMATH Open1302.90166OpenAlexW2169403817MaRDI QIDQ3003272FDOQ3003272
Author name not available (Why is that?)
Publication date: 26 May 2011
Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21311-3_5
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)
Cited In (25)
- Incorporating bounds from decision diagrams into integer programming
- Lagrangian bounds from decision diagrams
- Projection, consistency, and George Boole
- Theoretical insights and algorithmic tools for decision diagram-based optimization
- Constraint programming and operations research
- Improving branch-and-bound using decision diagrams and reinforcement learning
- Graph coloring with decision diagrams
- On finding the optimal BDD relaxation
- Optimization Bounds from Binary Decision Diagrams
- Extended formulations via decision diagrams
- On the Consistent Path Problem
- Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams
- Oblivious bounds on the probability of boolean functions
- Exploring relaxation induced neighborhoods to improve MIP solutions
- MDDs are efficient modeling tools: an application to some statistical constraints
- Decision Diagram Decomposition for Quadratically Constrained Binary Optimization
- Graph Coloring Lower Bounds from Decision Diagrams
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
- Stochastic decision diagrams
- Discrete optimization with decision diagrams
- Efficient operations between MDDs and constraints
- Improving Variable Orderings of Approximate Decision Diagrams Using Reinforcement Learning
- Target Cuts from Relaxed Decision Diagrams
- Compact representations of all members of an independence system
- Compiling CP subproblems to MDDs and d-DNNFs
This page was built for publication: Manipulating MDD Relaxations for Combinatorial Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3003272)
