🍀 O4A SimpleX Days 2026

How do you go from textbook models to solving real-world problems?

That’s the focus of this live FREE event: hands-on sessions with optimization experts who will guide you step by step in building solvers for problems that actually matter in practice.

November 5th 2026

5 PM to 7 PM CET

Introduction to Network Design Optimization with Tiago Montanher

This hands-on session introduces network design optimization, a critical problem across industries such as supply chain, energy, and telecommunications, where decisions on facility locations and flows drive cost and service performance.

Through a simple example of warehouse placement and customer allocation, participants will learn core modeling concepts.

The session includes practical Python implementations using SCIP, and extends beyond standard formulations to cover multiple objectives, soft constraints, and uncertainty, reflecting real-world complexity and decision-making needs

Registration Link

November 6th 2026

3 PM to 5 PM CET

Solving routing problems with PyVRP and Niels Wouda

In this hands-on session, participants will learn how to model and solve routing problems using PyVRP (https://pyvrp.org/), an open-source Python package for vehicle routing optimisation.

We begin with simple examples, model and solve them using PyVRP, and then slowly increase the complexity by adding more realistic business constraints.

Participants gain experience applying PyVRP to realistic routing problems and
understanding the solutions.

Registration Link

November 6th 2026

5 PM to 7 PM

Constraint Programming: MIP people need to know CP-SAT- Jens-Peter Joost

There is a solver out there that keeps winning OR challenges - and not enough people know about it!


In this hands-on session, we will explore Constraint Programming with CP-SAT.
We dive into several problems that could be modeled using MIP - but instead we will use Constraint Programming and CP-SAT and showcase for which scenarios it is superior to MIP.

What you'll learn:

  • How to formulate CP models and solve them with CP-SAT

  • Best practices for creating scalable formulations

  • When to use CP-approaches over MIP

  • A basic understanding of how CP-SAT works (Conflict Driven Clause Learning)

Tech stack: Google OR-Tools's CP-SAT (solving + modelling), Pydantic (data validation)

Registration Link