Automated streamliner portfolios for constraint satisfaction problems
From MaRDI portal
Publication:6161503
DOI10.1016/J.ARTINT.2023.103915OpenAlexW4361288402MaRDI QIDQ6161503FDOQ6161503
Authors:
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
- Essence: A constraint language for specifying combinatorial problems
- SATzilla: portfolio-based algorithm selection for SAT
- Towards objective measures of algorithm performance across instance space
- Principles and Practice of Constraint Programming – CP 2004
- Principles and Practice of Constraint Programming – CP 2004
- Title not available (Why is that?)
- Hypervolume indicator and dominance reward based multi-objective Monte-Carlo tree search
- Exploiting subproblem dominance in constraint programming
- Automatic Detection of Variable and Value Symmetries
- Filtering algorithms for the multiset ordering constraint
- Principles and Practice of Constraint Programming – CP 2003
- Title not available (Why is that?)
- Automatically improving constraint models in Savile Row
- On the Erdős Discrepancy Problem
- Theory and Applications of Satisfiability Testing
- Propagation algorithms for lexicographic ordering constraints
- Title not available (Why is that?)
- Algorithm Selection for Combinatorial Search Problems: A Survey
- Dominance breaking constraints
- Discriminating instance generation from abstract specifications: a case study with CP and MIP
- \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)
