Mixed Integer Programming European Workshop 2026

Posters

We are pleased to announce that the 2026 MIP Europe Conference will host a poster session together with a Best Poster Competition for Ph.D. students. Three prizes will be awarded: first prize, second prize, and third prize.

Participants who wish to present a poster must register for the conference by July 10, 2026 and indicate during registration that they intend to present a poster. Participants who have already registered and have already indicated their interest in presenting a poster do not need to fill in any additional form.

Interested participants are asked to submit a list of up to 10 highlights describing their poster. Each highlight must not exceed 150 characters (incl. whitespaces). The submission must be sent by August 20, 2026 to f.ciccarelli@uniroma1.it, using the same email address used for conference registration, with the subject line:

MIP Europe 2026 Poster Submission – [Your Surname]

Due to an unexpectedly high number of poster applications and limited space available for the poster session, we will be able to accept at most 20 posters. The list of accepted posters will be announced on August 31, 2026.

Authors of accepted posters will receive an email on the same day with the poster format specifications and all the information needed for the presentation.

Prize winners will be selected by an expert jury after the poster presentations during the conference.

Presented Posters

Felipe Albuquerque - The Capacitated Mobile p-Median Problem with Dynamic Demand

Alex Fabián Barrales Araneda - Integrated and Sequential Approaches for Electric Bus Timetabling and Vehicle Scheduling

Khawar Bashir - A Multi-Train Unloading Planning Problem in Maritime Container Terminals

Chris Cohadari - Spanning-Tree Branching for LP- and SDP-based Maximum Cut Solvers

Anna Livia Croella - CLAP: The Cannot-Link Anticlustering Problem for Bounding Minimum Sum-of-Squares Clustering with Constraints

Maurice de Kort - Smallest formulations with applications to the Traveling Salesman Problem

Federica Donnini - Signed Budget Uncertainty for Robust Mixed-Integer Optimization

Aloïs Duguet - On the Minimum Number of Linear Pieces Required to Approximate Nonlinear Functions under an Accuracy Constraint

Marouane Felloussi - Generic Branch-Cut-and-Price for Knapsack-Constrained Minsum Scheduling

Carlo Antonio Maria Gervasi - ADMM-based decomposition and certified global search for nonconvex MINLPs

Alexander Helber - Optimal Refinement in Dynamic Discretization Discovery for Continuous-Time Service Network Design

Sara Joosten - Investigating mixed-integer programming approaches for the p-α-closest-center problem

Layth Kashou - Integrated Planning and Scheduling in Reconfigurable Manufacturing Systems: A Deterministic MILP Approach

Martina Luzzi - Integrating pricing and capacity decisions in car rental: A matheuristic approach

Raja Babu Adityan - A Column Generation Approach for Large-Scale Crew Scheduling Problem in Indian Railways

Enes Şahin - Quantifying the Myopic Optimality Gap in Multi-Period Binary Optimization with Temporal Turnover Costs

Vladimir Stadnichuk - Solving Multi-Follower Mixed-Integer Bilevel Problems with Binary Linking Variables

Simon Stevens - Bilevel Optimization with a Piecewise-Linear Follower

Gennesaret Kharistio Tjusila - CHAP: A Hybrid GPU-CPU Heuristic for MIP

Rolf van der Hulst - Folding Symmetries in Mixed-Integer Linear Programs

Virginia Verna - An LLM-Based Framework for Planner-Authored Heuristics in Mixed Integer Programming