About Me

Outline drawing of Jip J. Dekker

Hi! 👋

My name is Jip J. Dekker. Welcome to my corner of the internet! I am a researcher with a passion for programming languages and optimization. As a research fellow in the OPTIMA ARC training centre, my work at Monash University is twofold: to advance an industry-ready optimization toolkit, and apply these techniques in industry (with some wonderful PhD students).

This puts me in a unique position to work on MiniZinc, a solver-independent constraint modelling language. MiniZinc can create high-level models of optimization problems. The user can take advantage of a large library of pre-defined constraints that are automatically translated to a wide range of solvers, including CP, MIP, SAT, and SMT. I work both on the core MiniZinc language and its compiler, as well as transformations of MiniZinc models, and smart interfaces to its supported solvers to allow for, for example, incremental solving algorithms.


Bierlee, Gange, Tack, Dekker & Stuckey (2022)
, , , & (). Coupling different integer encodings for SAT. Springer. https://doi.org/10.1007/978-3-031-08011-1_5
Dekker (2013)
(). Generating a google go framework from an uppaal model  (Bachelor's Thesis). Radboud University, Institute for Computing; Information Sciences
Dekker (2016)
(). Sub-problem pre-solving in MiniZinc  (Master's Thesis). Uppsala University, Department of Information Technology
Dekker, Björdal, Carlsson, Flener & Monette (2017)
, , , & (). Auto-tabling for subproblem presolving in MiniZinc. Constraints, 22(4). 512–529. https://doi.org/10.1007/s10601-017-9270-5
Dekker, Garcia de la Banda, Schutt, Stuckey & Tack (2018)
, , , & (). Solver-independent large neighbourhood search. Springer. https://doi.org/10.1007/978-3-319-98334-9_6
Dekker (2021)
(). A modern architecture for constraint modelling languages  (Ph.D. Thesis). Monash University, Clayton School of IT; Monash University, Department of Data Science; AI https://doi.org/10.26180/16968229.v1
Lam, Gange, Stuckey, Van Hentenryck & Dekker (2020)
, , , & (). Nutmeg: A MIP and CP hybrid solver using branch-and-check. Springer.