The MiniZinc Challenge 2008–2013

  • Peter J. Stuckey National ICT Australia and the University of Melbourne
  • Thibaut Feydy National ICT Australia and the University of Melbourne
  • Andreas Schutt National ICT Australia and the University of Melbourne
  • Guido Tack National ICT Australia and Monash University
  • Julien Fischer Opturion

Abstract

MiniZinc is a solver agnostic modeling language for defining and solver combinatorial satisfaction and optimization problems. MiniZinc provides a solver independent modeling language which is now supported by constraint programming solvers, mixed integer programming solvers, SAT and SAT modulo theory solvers, and hybrid solvers. Since 2008 we have run the MiniZinc challenge every year, which compares and contrasts the different strengths of different solvers and solving technologies on a set of MiniZinc models. Here we report on what we have learnt from running the competition for 6 years.
Published
2014-06-19
Section
Competition Reports