Variable ordering for decision diagrams: a portfolio approach

DOI10.1007/s10601-021-09325-6zbMath1496.91043OpenAlexW4206839164MaRDI QIDQ2152280

Willem-Jan van Hoeve, Anthony Karahalios

Publication date: 7 July 2022

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-021-09325-6

zbMATH Keywords

graph coloringvariable orderingdecision diagrams

Mathematics Subject Classification ID

Decision theory (91B06) Algorithms in computer science (68W99)

Related Items (2)

Column elimination for capacitated vehicle routing problems ⋮ Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams

Uses Software

• SATzilla
• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• DIMACS
• Decision diagrams for optimization
• Algorithm portfolio selection as a bandit problem with unbounded losses
• Maximum-weight stable sets and safe lower bounds for graph coloring
• Optimization Bounds from Binary Decision Diagrams
• Graph-Based Algorithms for Boolean Function Manipulation
• A Sufficient Condition for Backtrack-Free Search
• New methods to color the vertices of a graph
• Branching Programs and Binary Decision Diagrams
• Algorithm Selection for Combinatorial Search Problems: A Survey
• Graph Coloring Lower Bounds from Decision Diagrams
• Collective dynamics of ‘small-world’ networks
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Algorithm portfolios

This page was built for publication: Variable ordering for decision diagrams: a portfolio approach