On finding the optimal BDD relaxation

DOI10.1007/978-3-319-59776-8_4MaRDI QIDQ2011572zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 4 August 2017

Full work available at URL https://doi.org/10.1007/978-3-319-59776-8_4

Mathematics Subject Classification ID

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

Recommendations

• Optimization Bounds from Binary Decision Diagrams
• Discrete optimization with decision diagrams
• Manipulating MDD relaxations for combinatorial optimization
• A local search framework for compiling relaxed decision diagrams
• Compact representations of all members of an independence system

Cites work

• A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
• Binary Decision Diagrams
• Decision diagrams for optimization
• Discrete optimization with decision diagrams
• Dynamic programming and optimal control. Vol. 2
• Graph-Based Algorithms for Boolean Function Manipulation
• MDD propagation for sequence constraints
• Manipulating MDD relaxations for combinatorial optimization
• On threshold BDDs and the optimal variable ordering problem
• Optimization Bounds from Binary Decision Diagrams

Cited in

(7)

• Graph coloring with decision diagrams
• A local search framework for compiling relaxed decision diagrams
• \(\mathrm{A}^*\)-based construction of decision diagrams for a prize-collecting scheduling problem
• Discrete optimization with decision diagrams
• Improving the filtering of branch-and-bound MDD solver
• Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
• Manipulating MDD relaxations for combinatorial optimization

Describes a project that uses

Uses Software

• azove

This page was built for publication: On finding the optimal BDD relaxation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011572)