Results for the 2024 MiniZinc Challenge have now been announced!

MiniZinc

MiniZinc is a high-level constraint modelling language that allows you to easily express and solve discrete optimisation problems.

Get startedDownload

Latest release: 2.8.7 (changelog)

PackagesSource codeLicense information

MiniZinc is developed at Monash University with support from OPTIMA.

AimeeAlidaArvilBeulaCiaraColonDarbyDianaDonnaDulceEliasElvieErnstEssieGreenJeradJesseJimmyJodieJulieKatieKeionKelsiKizzyLarryLeafyLloydLymanMableMartyMerleMetroMistiMykelNeliaNevinPaulaSheriTeddyWayne
Table seating allocation
MonTueWedThuFri
Aimee
Night
Evening
Day
Evening
Beula
Evening
Day
Evening
Night
Evening
Ciara
Day
Evening
Night
Darby
Evening
Evening
Night
Ernst
Night
Evening
Evening
Day
Green
Evening
Evening
Day
Night
Jesse
Day
Day
Day
Night
Katie
Day
Day
Evening
Day
Lloyd
Day
Day
Night
Evening
Mable
Night
Day
Day
Evening
Nevin
Evening
Day
Day
Evening
Day
Paula
Night
Evening
Evening
Day
Rostering
Vehicle routing

Try MiniZinc

Try one of the examples, or write your own model.

Why choose MiniZinc?

  • High-level language

    Model constraint satisfaction and optimisation problems using readable, intuitive logical constructs, with full type safety.

  • Solver independent

    Run the same model using a variety of different solver technologies, without being locked into a particular solver.

  • Pre-defined constraints

    MiniZinc features a large library of pre-defined constraints, making modelling complex relationships simple.

  • Fully featured development environment

    Use the MiniZinc IDE to write and run models, visualise search and solutions, profile performance and more.

  • In-depth learning materials

    MiniZinc has comprehensive documentation, including the tutorial, several courses, the user manual, and library documentation.

  • Integrate MiniZinc into your project

    MiniZinc can be embedded into Python and JavaScript programs, and can even be used entirely from within the browser.

Latest Release

MiniZinc 2.8.7

Released 2 October 2024

  • Variable in operators on arrays of (nested) records and tuples containing only enumerable (enum, int, or bool) will now be rewritten into table global constraints.
    • Values that are par in the left hand side will be checked and filtered from the resulting table constraint.
  • Variable <, <=, > and >= operators on (nested) records and tuples containing only enumerable (enum, int, or bool) will now be rewritten into lex_less or lex_lesseq global constraints.
  • Automatically detect SCIP 9.0.1 and potential future versions on Windows.
  • The interface to the HiGHS solver now requires version 1.7.2 or later.
  • Enforce strict enum type correctness for set operations (:bugref:828).
  • Add par opt overloads of min / max and return enum values instead of coercing to integers.
  • Use half-reification only when there isn't a reification that is a more specific match.
  • Add multidimensional overloads for the ++ array concatenation operator.
  • Plus more than 25 bug fixes.

See the full changelog.

View all releases

Get your MiniZinc stickers, mugs, t-shirts etc. (sold at cost price)!