Blog post7 min read
Gecode 6.3.0 and 6.4.0 are releasedDraft
Gecode 6.3.0 collects seven years of solver and MiniZinc integration work, while 6.4.0 modernizes the build, adds new propagation functionality, and starts a more active release line.
Blog - Constraint programming
Blog post4 min read
Propagating the minimum distance between selected pointsDraft
Selecting well-spaced points looks simple, but the usual decomposition creates quadratically many auxiliary variables. This post compares direct Gecode propagators and shows how a matching bound can strengthen them.
Blog post3 min read
What happens when Sudoku scales?Draft
The main result is a public collection of 434,201 generated Sudoku instances, ranging from 6×6 to 36×36. The paper's experiments provide a map of how their propagation-based hardness changes with size.
Blog post4 min read
Table Talk TuningDraft
A real wedding seating plan led to a MiniZinc model that balances practical requests with the chance of finding something to talk about. The post shows the central constraints and the mixed-radix objective.
Blog post23 min read
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.
Blog post19 min read
Rotating Workforce Scheduling in MiniZincDraft
Solving the Rotating Workforce Scheduling problem using MiniZinc.
Blog post6 min read
The Work Task Variation ProblemDraft
The Work Task Variation Problem, a paper by Mikael Z. Lagerkvist and Magnus Rattfeldt at CP 2025.
Blog post17 min read
On Benchmarking MiniZinc and the LinkedIn Queens ProblemDraft
On Benchmarking MiniZinc and the LinkedIn Queens Problem
Blog post9 min read
Solving LinkedIn Queens using MiniZincDraft
Solving LinkedIn Queens using MiniZinc
