The entrants for this year (with their descriptions, when provided):
In addition, the challenge organisers entered the following FlatZinc and MiniZinc 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 (JaCoP) were automatically included in the free search category, while entries in the free search category (Concrete, chuffed, G12/FD, MinisatID, MinisatID-MP, Mistral, Opturion CPX, OscaR/CBLS, Picat CP, Picat SAT and promoted FD entries) were automatically included in the parallel search category. Lastly, all entries in the parallel search category and promoted entries into that category were automatically included in the open search category.
All times are given in milliseconds.
A score of 0.0 indicates a worse answer in quality (worse objective, no proof of optimality, or no answer for satisfaction problems), 1.0 a better solution in quality. When the quality is the same, the 1.0 purse is split with respect to time used.
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, -par or -open (for the parallel portfolio solver entered) 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. In addition, the columns RC and SBC respectively indicates whether the model contains redundant or/and symmetry breaking constraints.
|Model||RC||SBC||Global constraints used|
|mapping||bin_packing_load, count, maximum, network_flow_cost|
|p1f||X||alldifferent, inverse, lex_less|
|roster||at_least, at_most, exactly|
The files on this page are for MiniZinc version 2.0.4.