On finding the optimal BDD relaxation

DOI10.1007/978-3-319-59776-8_4zbMath1489.68248OpenAlexW2618496063MaRDI QIDQ2011572

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

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

Related Items

Decision Diagrams for Discrete Optimization: A Survey of Recent Advances ⋮ \( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem ⋮ Improving the filtering of branch-and-bound MDD solver ⋮ Graph coloring with decision diagrams

Uses Software

• azove

Cites Work

• Unnamed Item
• Decision diagrams for optimization
• On threshold BDDs and the optimal variable ordering problem
• A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
• Discrete Optimization with Decision Diagrams
• Optimization Bounds from Binary Decision Diagrams
• Manipulating MDD Relaxations for Combinatorial Optimization
• Graph-Based Algorithms for Boolean Function Manipulation
• Binary Decision Diagrams
• MDD Propagation for Sequence Constraints