Automated streamliner portfolios for constraint satisfaction problems
From MaRDI portal
Publication:6161503
Cites work
- scientific article; zbMATH DE number 1975610 (Why is no real title available?)
- scientific article; zbMATH DE number 2084734 (Why is no real title available?)
- Algorithm selection for combinatorial search problems: a survey
- Automatic Detection of Variable and Value Symmetries
- Automatically improving constraint models in Savile Row
- Discriminating instance generation from abstract specifications: a case study with CP and MIP
- Dominance breaking constraints
- Essence: A constraint language for specifying combinatorial problems
- Exploiting subproblem dominance in constraint programming
- Filtering algorithms for the multiset ordering constraint
- Hypervolume indicator and dominance reward based multi-objective Monte-Carlo tree search
- Model counting: a new stategy for obtaining good bounds
- On the Erdős discrepancy problem
- Principles and Practice of Constraint Programming – CP 2003
- Principles and Practice of Constraint Programming – CP 2004
- Principles and Practice of Constraint Programming – CP 2004
- Propagation algorithms for lexicographic ordering constraints
- SATzilla: portfolio-based algorithm selection for SAT
- Theory and Applications of Satisfiability Testing
- Towards objective measures of algorithm performance across instance space
- \textsc{Conjure}: automatic generation of constraint models from problem specifications
Cited in
(1)
This page was built for publication: Automated streamliner portfolios for constraint satisfaction problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6161503)