Live briefing
Everything about MiniZinc
Constraint modeling language
MiniZinc is a constraint modelling language to describe and solve high-complexity problems using a variety of well-known solving paradigms for combinatorial problems including constraint programming, integer programming, SAT, and SMT. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: MiniZincA 5-minute orientation
- Skim a recent paper: MiniZinc with objectsInfluential work since 2022
- Pick up a classic book: Building Decision Support SystemsThe most-reprinted book on the subject
- Read the landmark paper: The MiniZinc Challenge 2008–2013Cited 66 times
- Go sideways: Constraint satisfactionA closely related topic
- Go sideways: List of optimization softwareA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
The MiniZinc Challenge 2008–2013
Philosophy of the MiniZinc challenge
A constraint-based local search backend for MiniZinc
MiniBrass: Soft constraints for MiniZinc
Auto-tabling for subproblem presolving in MiniZinc
Automatic Logic-Based Benders Decomposition with MiniZinc
SUNNY-CP and the MiniZinc challenge
Formulation of Sudoku Puzzle Using Binary Integer Linear Programming and Its Implementation in Julia, Python, and Minizinc
🆕 Influential since 2022
📚 Books worth reading
Building Decision Support SystemsMark Wallace · 2020
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Constraint satisfaction In artificial intelligence and operations research, constraint satisfaction is the process of finding a solution through a set of constraints that impose…
- List of optimization software Given a transformation between input and output values, described by a mathematical function, optimization deals with generating and selecting the best…
- Optimization Programming Language Optimization Programming Language (OPL) is an algebraic modeling language for mathematical optimization models, which makes the coding easier and shorter…
- OR-Tools Google OR-Tools is a free and open-source software suite developed by Google for solving linear programming (LP), mixed integer programming (MIP), constraint…
- Constraint programming Constraint programming (CP) is a paradigm for solving combinatorial problems that draws on a wide range of techniques from artificial intelligence, computer…
- Algebraic modeling language Algebraic modeling languages (AML) are high-level computer programming languages for describing and solving high complexity problems for large scale mathematica…
- Answer set programming Answer set programming (ASP) is a form of declarative programming oriented towards difficult (primarily NP-hard) search problems. It is based on the stable…
- Nonlinear programming In mathematics, nonlinear programming (NLP), also known as nonlinear optimization, is the process of solving an optimization problem where some of the…