Solving the Partridge Packing Problem using MiniZincDraft
A MiniZinc walk-through of the Partridge Packing Problem: pack one 1×1 square, two 2×2 squares, and so on into a square with exactly the same total area.

Constraint programming with MiniZinc
This collection focuses on constraint programming using the MiniZinc modeling language. MiniZinc is a high-level modeling language for constraint satisfaction and optimization problems that is solver-agnostic and designed for expressing models clearly and naturally.
MiniZinc is a constraint modeling language that allows you to express combinatorial optimization problems in a high-level, readable format. It’s designed to be solver-agnostic, meaning you can use the same model with different types of solvers including:
A MiniZinc walk-through of the Partridge Packing Problem: pack one 1×1 square, two 2×2 squares, and so on into a square with exactly the same total area.

Solving the Rotating Workforce Scheduling problem using MiniZinc.

On Benchmarking MiniZinc and the LinkedIn Queens Problem

Solving LinkedIn Queens using MiniZinc
