Manipulating MDD relaxations for combinatorial optimization

DOI10.1007/978-3-642-21311-3_5MaRDI QIDQ3003272zbMATH OpenOpenAlexFDO

Authors

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

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Recommendations

• On finding the optimal BDD relaxation
• Optimization Bounds from Binary Decision Diagrams
• A local search framework for compiling relaxed decision diagrams
• Theoretical insights and algorithmic tools for decision diagram-based optimization
• Discrete optimization with decision diagrams

Cited in

(25)

• Constraint programming and operations research
• Exploring relaxation induced neighborhoods to improve MIP solutions
• MDDs are efficient modeling tools: an application to some statistical constraints
• On finding the optimal BDD relaxation
• Improving branch-and-bound using decision diagrams and reinforcement learning
• Graph coloring with decision diagrams
• Stochastic decision diagrams
• Efficient operations between MDDs and constraints
• Compiling CP subproblems to MDDs and d-DNNFs
• Theoretical insights and algorithmic tools for decision diagram-based optimization
• Projection, consistency, and George Boole
• Discrete optimization with decision diagrams
• Oblivious bounds on the probability of boolean functions
• Optimization Bounds from Binary Decision Diagrams
• Decision Diagram Decomposition for Quadratically Constrained Binary Optimization
• Graph coloring lower bounds from decision diagrams
• Improving variable orderings of approximate decision diagrams using reinforcement learning
• Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
• Compact representations of all members of an independence system
• Target cuts from relaxed decision diagrams
• On the consistent path problem
• Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams
• Extended formulations via decision diagrams
• Incorporating bounds from decision diagrams into integer programming
• Lagrangian bounds from decision diagrams

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)