Results for the 2024 MiniZinc Challenge have now been announced!

MiniZinc Challenge 2016

The Challenge

The aim of the challenge is to start to compare various constraint solving technology on the same problems sets. The focus is on finite domain propagation solvers. An auxiliary aim is to build up a library of interesting problem models, which can be used to compare solvers and solving technologies.

Entrants to the challenge provide a FlatZinc or MiniZinc solver and global constraint definitions specialized for their solver. Each solver is run on 100 MiniZinc model instances. For FlatZinc solvers, we run the translator mzn2fzn on the MiniZinc model and instance using the provided global constraint definitions to create a FlatZinc file. The FlatZinc file is input to the provided FlatZinc solver. For MiniZinc solvers, the MiniZinc model and instance are input to the provided solver. Points are awarded for solving problems, speed of solution, and goodness of solutions (for optimization problems).

Announcements

  • 2016-09-05 Announcement of the results available here.
  • 2016-07-11 Announcement of MiniZinc Challenge Judges.
  • 2016-05-20 Official Call for Participation for the MiniZinc Challenge has been made.
  • 2016-05-20 MiniZinc problem submission deadline was extended till 28 May 2016
  • 2016-02-19 Initial Call for MiniZinc Problems has been made.

Dates

  • Registration opens: Closed.
  • Problem submission deadline: Sun, 22 May 2016 Sat, 28 May 2016.
  • Initial submission round begins: Sat, 25 June 2016.
  • Initial submission round ends: Sat, 16 July 2016.
  • Final submissions: Sat, 30 July 2016.
  • Announcement of results at CP2016: 5 - 9 September 2016.

Registration

Entrants must register their intention to enter the contest before the first submission round.
The first submission round is an opportunity for us to provide feedback concerning your entry; it does not count towards the final result.
Feel free to register and later withdraw.

To register send an email with the following subject line

[MZNC16] registration

to

mzn-challenge ‘at’ minizinc.org

In the body of the email please include an email address at which we can contact you.

Submission

We will provide submission details via email to the address provided above.

Problem Submission

We strongly encourage all entrants to submit one or two MiniZinc models satisfying the contest requirements, together with instances for these models. They can be submitted as tarballs to:

mzn-challenge ‘at’ minizinc.org

The sooner they are submitted the better, the deadline is Sun, 22 May 2016. The call for problem submission is available here. Please feel free to distribute it.

Rules

The rules for the MiniZinc Challenge 2016 are available here.
If we need to make changes to the rules, all registered entrants will be informed by email.

Judges

The judges will be responsible for selecting the tested instances, vetting the results, and ruling on any questions that arise during the competition.

  • Jimmy H.M. Lee. Chinese University of Hong Kong.
  • Barry O'Sullivan, Cork Constraint Computation Center.
  • Roland Yap, National University of Singapore.

Feedback

This is the nineth time this challenge is run, and there are many possibilities for comparing CP solvers. The rules try to make a sensible set of choices for the comparison. We would welcome any comments or suggestions regarding the running of this challenge.

We can be contacted with the subject starting with [MZNC16] at:

mzn-challenge ‘at’ minizinc.org

MiniZinc forums

The MiniZinc forum is for beginners, users, and developers to discuss MiniZinc. If you would like to join then sign up for the MiniZinc forums.

Links

The MiniZinc page includes a list of resources related to MiniZinc and FlatZinc.

The MiniZinc 2.0 Distribution includes a MiniZinc-to-FlatZinc converter and a large suite of MiniZinc examples and benchmarks.

The MiniZinc Challenge 2015 webpage, include the results from the previous year.

The MiniZinc Challenges 2008-2015 webpage, include the results from each MiniZinc Challenge.