Eleon Bach - Optimal Smoothed Analysis of the Simplex Method

Alex Fabián Barrales Araneda - Solving the Train Dispatching Problem: A Two-Stage Approach

Nicolas Besson - Collaborative Logistics in Short Food Supply Chains - A game theoretical approach

Lukas Brandl - Primal Separation and Approximation for the {0, 1/2}-Closure

Aloïs Duguet - Branch-and-Cut for Mixed-Integer Programming Games

Adam Dunajski - Using MILP to Enforce Stability in Capacitated Facility Location Problems with Customer Preferences

Hubert Villuendas - Knapsack with compactness: a semidefinite approach

Jannik Irmai - Chorded cycle facets of the clique partitioning polytope

Montree Jaidee - The Prime Programming Problem: Formulations and Solution Methods

Adéchola Kouande - Learning to branch on general disjunctions

Henri Lefebvre - Computing Feasible Points of Mixed-Integer Bilevel Problems with a Penalty Alternating Direction Method

Antoine Lhomme - Bounds on randomized algorithms for online bin stretching

Koen Ligthart - Parameterized Algorithms for Matching Integer Programs with Additional Rows and Columns

Cédric Roy - Computational Aspects of Lifted Cover Inequalities for Knapsacks with Few Different Weights

Somayeh Shamsi - Probabilistic Lookahead Strong Branching via a Stochastic Abstract Branching Model

Mathieu Vallée - Totally equimodular matrices: decomposition and triangulation

Patxi Flambard - A semi-infinite constraint generation algorithm for adjustable robust optimization