Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges
From MaRDI portal
Publication:5743603
DOI10.1007/978-3-319-27436-2_21zbMath1473.68184DBLPconf/lopstr/AmadiniGM15OpenAlexW2405799423WikidataQ62043681 ScholiaQ62043681MaRDI QIDQ5743603
Maurizio Gabbrielli, Jacopo Mauro, Roberto Amadini
Publication date: 5 February 2016
Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01227598/file/lopstr_2015.pdf
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Portfolio approaches for constraint optimization problems
- ASlib: a benchmark library for algorithm selection
- Philosophy of the MiniZinc challenge
- Compiling finite linear CSP into SAT
- Essence: A constraint language for specifying combinatorial problems
- A self-adaptive multi-engine solver for quantified Boolean formulas
- Propagation via lazy clause generation
- meSAT: multiple encodings of CSP to SAT
- A machine learning approach to algorithm selection for \(\mathcal{NP}\)-hard optimization problems: a case study on the MPE problem
- SUNNY: a Lazy Portfolio Approach for Constraint Solving
- Careful Ranking of Multiple Solvers with Timeouts and Ties
- Multi-engine ASP solving with policy adaptation
- Automatically Exploiting Subproblem Equivalence in Constraint Programming
- ParamILS: An Automatic Algorithm Configuration Framework
- aspeed: Solver scheduling via answer set programming
- 10.1162/153244303322753616
- Representative Encodings to Translate Finite CSPs into SAT
- Algorithm portfolios
This page was built for publication: Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges