Avatar

drs. Jip J. Dekker

PhD Candidate

Monash University

Data61

Biography

Jip J. Dekker is a doctor of philosophy (PhD) candidate at Monash University. His research focuses on combinatorial optimisation, operational research, and programming languages. His PhD program is supervised by Guido Tack, Peter J. Stuckey, Maria Garcia de la Banda (Monash University), and Andreas Schutt (Data61). His thesis will focus on the MiniZinc language for high-level constraint modelling.

Jip originates from the Netherlands and lived in Sweden for three years. Apart from his work as a volunteer for various student organisations, Jip is an amateur musician; he conducts and sings in choirs and is a beginning piano player.

Interests

  • Programming Languages
  • Combinatorial Optimisation
  • Operational Research

Education

  • MSc in Computer Science, 2017

    Uppsala University

  • BSc in Computing Science, 2014

    Radboud University

Recent Posts

Implementing custom DTrace instrumentation

Setting up instrumentation for a programming language runtime.
Last updated on 29 Mar 2019 5 min read Side Projects

Recent & Upcoming Talks

An abstract machine model for MiniZinc - Doctoral Program Talk

The use of meta-heuristic algorithms, such as Large Neighbourhood Search, Lexicographic Search, and Interactive Search, has proven to …
30 Sep 2019 11:00 — 12:30 UCONN Stamford
Project Slides

Solver independent Large Neighbourhood Search

The combination of large neighbourhood search (LNS) methods with complete search methods has proved to be very effective. By …
31 Aug 2018 13:30 — 14:20 Euratechnologies
Project Slides

Recent Publications

Solver-independent Large Neighbourhood Search

The combination of large neighbourhood search (LNS) methods with complete search methods has proved to be very effective. By …
Preprint Code Project DOI MiniZinc Gecode Chuffed

Auto-tabling for subproblem presolving in MiniZinc

A well-known and powerful constraint model reformulation is to compute the solutions to a model part, say a custom constraint …
Preprint PDF Code Project DOI HTML

Sub-problem pre-solving in MiniZinc

Constraint models often describe complicated problems that contain sub-problems that could be solved in sub-models. Although …
PDF Code Project DiVA

Generating a Google Go framework from an Uppaal model

Dealing with concurrency and parallelism is hard. Using scientific tools, models can be created giving insight into the nature of …
PDF

Contact