Promoting robust black-box solvers through competitions

DOI10.1007/s10601-010-9092-1zbMath1208.68203OpenAlexW2157275554MaRDI QIDQ606901

Olivier Roussel, M. R. C. van Dongen, Christophe Lecoutre

Publication date: 19 November 2010

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-010-9092-1

zbMATH Keywords

black-boxexperimental evaluationrobust constraint solverssolver competition

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming

Uses Software

• Choco
• CaSPER
• Sugar
• MINION
• Mistral

Cites Work

• Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
• Partition search for non-binary constraint satisfaction
• Compiling Finite Linear CSP into SAT
• Principles and Practice of Constraint Programming – CP 2004
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Promoting robust black-box solvers through competitions