PROGRAM
Monday 6
Chair:Gerard Cornuejols
08:15-08:30
The Organizers
Welcome
08:30-09:00
Amitabh Basu
On the Unique-lifting Property
09:00-09:30
Gennadiy Averkov
Bounds on the complexity of maximal S-free sets
09:30-10:00
Marco Molinaro
How Good Are Sparse Cutting-Planes?

Chair:Volker Kaibel
10:30-11:00
Stefan Weltge
Lower Bounds on the Sizes of Integer Programs Without Additional Variables
11:00-11:30
Samuel Fiorini
Average case polyhedral complexity of the maximum stable set problem
11:30-12:00
Sebastian Pokutta
Common information and Extended Formulations

Chair:Michael Jünger
17:15-17:45
Hande Yaman
The Split Delivery Vehicle Routing Problem
17:45-18:15
Axel Parmentier
Aircraft routing problem: complexity and linear integer program

18:30-19:00
Carla Michini
On the diameter of lattice polytopes
19:00-19:30
Yann Disser
In defense of Simplex’ worst-case behavior


Tuesday 7
Chair:Ridha Mahjoub
08:30-09:00
Matteo Fischetti
Self-splitting of workload in parallel computation
09:00-09:30
Andrea Tramontani
Concurrent Root Cut Loops to Exploit Performance Variability
09:30-10:00
Gerald Gamrath
Improving strong branching by domain propagation

Chair:Jeff Linderoth
10:30-11:00
Jean-Philippe Richard
On the convex hull of some nonlinear sets
11:00-11:30
Fatma Kilinc-Karzan
Structure of Valid Inequalities for Mixed Integer Conic Programs
11:30-12:00
Sam Burer
A Two-Variable Analysis of the Two-Trust-Region Subproblem

Chair:Gerd Reinelt
17:15-17:45
Kenjiro Takazawa
Finding 2-factors closer to TSP tours in cubic graphs
17:45-18:15
Yanjun Li
Valid Inequalities for the 1-Restricted Simple 2-Matching Polytope

18:30-19:00
Mehdi Madani
Reformulation of a market clearing problem avoiding complementarity constraints, and its consequences
19:00-19:30
Andrea Lodi
Indicator Constraints in Mixed-Integer Programming


Wednesday 8
Chair:Jens Vygen
08:30-09:00
Tamas Kis
Approximation schemes for singe/machine scheduling problems with additional non-renewable resources
09:00-09:30
Wiebke Höhn
On the performance of Smith's rule in single-machine scheduling with nonlinear cost
09:30-10:00
Marc Uetz
Stochastic Scheduling on Unrelated Machines

Chair:Jon Lee
10:30-11:00
Egon Balas
Recent progress on Generalized Intersection Cuts
11:00-11:30
Sercan Yildiz
Sufficiency of Cut-Generating Functions
11:30-12:00
Britta Peis
Finding small stabilizers for unstable graphs

Chair:Giovanni Rinaldi
17:15-17:45
Fritz Boekler
On Multiobjective Linear Programming with an Application to Multiobjective Combinatorial Optimization Problems
17:45-18:15
Marco Senatore
The Online Replacement Path Problem

18:30-19:00
Stefano Gualandi
On the separation of rank inequalities for the max stable set problem
19:00-19:30
Francisco Barahona
Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs


Thursday 9
Chair:Bernhard Korte
08:30-09:00
Martim Moniz
Models for traffic engineering with multiple spanning tree protocols
09:00-09:30
Marika Karbstein
Approximation and Min-Max Results for the Steiner Connectivity Problem
09:30-10:00
Stephan Held
A Fast Algorithm for Rectilinear Steiner Trees with Length Restrictions on Obstacles

Chair:Robert Weismantel
10:30-11:00
Pietro Belotti
Heuristics for nonconvex MINLP
11:00-11:30
Laura Klein
Cutting planes for quadratic combinatorial optimization containing one product variable
11:30-12:00
Timm Oertel
Convex Integer Minimization in Variable Dimension

Chair:Martine Labbé
17:15-17:45
Pauline Sarrabezolles
Colorful linear programming
17:45-18:15
Antonio Rodriguez Chia
Incorporating order requirements in the design of hub-and-spoke net- works

18:30-19:00
Eduardo Uchoa
Improved Branch-Cut-and-Price for Capacitated Vehicle Routing
19:00-19:30
Achim Hildenbrandt
The Target Visitation Problem


Friday 10
Chair:Maurice Queyranne
08:30-09:00
Satoru Fujishige
A Min-Max Theorem for Transversal Submodular Functions and Its Implications
09:00-09:30
Simge Kucukyavuz
Finitely Convergent Decomposition Algorithms for Two-Stage Stochastic Pure Integer Programs
09:30-10:00
Jim Luedtke
Split cuts for stochastic integer programming

Chair:Bernard Fortz
10:30-11:00
Daniel Schmidt
Basic Network Design: Single Commodity Flows with uncertain demands.
11:00-11:30
Domenico Salvagnin
On Solving a Hard Quadratic 3-Dimensional Assignment Problem
11:30-12:00
Tom McCormick
Discrete Newton Algorithms for Budgeted Network Problems