Automated streamliner portfolios for constraint satisfaction problems
From MaRDI portal
Publication:6161503
DOI10.1016/j.artint.2023.103915OpenAlexW4361288402MaRDI QIDQ6161503
No author found.
Publication date: 27 June 2023
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2023.103915
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Towards objective measures of algorithm performance across instance space
- Hypervolume indicator and dominance reward based multi-objective Monte-Carlo tree search
- Exploiting subproblem dominance in constraint programming
- Filtering algorithms for the multiset ordering constraint
- Essence: A constraint language for specifying combinatorial problems
- Automatically improving constraint models in Savile Row
- Discriminating instance generation from abstract specifications: a case study with CP and MIP
- \textsc{Conjure}: automatic generation of constraint models from problem specifications
- Dominance breaking constraints
- Propagation algorithms for lexicographic ordering constraints
- Automatic Detection of Variable and Value Symmetries
- Algorithm Selection for Combinatorial Search Problems: A Survey
- On the Erdős Discrepancy Problem
- Theory and Applications of Satisfiability Testing
- Principles and Practice of Constraint Programming – CP 2003
- Principles and Practice of Constraint Programming – CP 2004
- Principles and Practice of Constraint Programming – CP 2004
This page was built for publication: Automated streamliner portfolios for constraint satisfaction problems
