The entrants for this year (with their descriptions, when provided):
In addition, the challenge organisers entered the following FlatZinc implementations:
As per the challenge rules, these entries are not eligible for prizes, but do modify the scoring results. Furthermore, entries in the FD search category were automatically included in the free search category, while entries in the free search category (including promoted FD entries) were automatically included in the parallel search category.
All times are given in seconds.
Scores of 0, 1 and 2 are used in the tables rather than 0, 0.5 and 1.
If a promoted entry does not recognize an option (or states that it is just ignored), times and solutions from the previous category are used for scoring. The suffixes -fd, -free and -par at the end of the solvers names indicate which configuration the solvers were run with.
mzn2fzn was run with the same time and memory limits as the solvers.
In the Status column:
Total per problem:
The following table lists the global constraints used by each model in this year's challenge.
|Model||Global constraints used|
A gzipped tarball containing all of the problems used in this year's MiniZinc challenge is available here.
The files on this page are for MiniZinc version 1.5.