Philosophy of the MiniZinc challenge

DOI10.1007/s10601-010-9093-0zbMath1208.68207OpenAlexW2016194356MaRDI QIDQ606904

Ralph Becket, Julien Fischer, Peter J. Stuckey

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-9093-0

zbMATH Keywords

searchmodelling languagescomparing solvers

Mathematics Subject Classification ID

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

Related Items (8)

A constraint-based local search backend for MiniZinc ⋮ Automatic generation of dominance breaking nogoods for a class of constraint optimization problems ⋮ Solving constraint satisfaction problems with SAT modulo theories ⋮ MiningZinc: a declarative framework for constraint-based mining ⋮ Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges ⋮ Debugging unsatisfiable constraint models ⋮ MiniZinc ⋮ Wombit: a portfolio bit-vector solver using word-level propagation

Uses Software

• SCIP
• FlatZinc
• Gecode
• JaCoP
• SICStus

Cites Work

• Constraint Logic Programming Using ECLⁱPS^e

This page was built for publication: Philosophy of the MiniZinc challenge