PROGRAM
Monday 9
08:15-08:30
The Organizers
Welcome

Chair:Michael Jünger
08:30-09:00
Oktay Günlük
Lattice Closures of Polyhedra
09:00-09:30
Dabeen Lee
On the Rational Polytopes with Chvatal Rank 1
09:30-10:00
Stefan Weltge
Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank

Chair:Gerhard Reinelt
10:30-11:30
Rolf Möhring
Integrating Scheduling and Routing in Logistics - A Real World Project
11:30-12:00
Martin Schmidt
Optimal Price Zones of Electricity Markets: A Mixed-Integer Multilevel Model and Global Solution Approaches

Chair:Giovanni Rinaldi
17:30-18:00
Lars Schewe
Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps
18:00-18:30
Ambros Gleixner
Verifying Integer Programming Results
18:30-19:00
Andreas Tillmann
Sparse Signal Reconstruction with Integrality Constraints
19:00-19:30
Kathrin Klamroth
Multiobjective Unconstrained Combinatorial Optimization: Weight Space Decomposition, Arrangements of Hyperplanes and Zonotopes


Tuesday 10
Chair:Christoph Helmberg
08:30-09:30
Leo Liberti
Undecidability and Hardness in MINLP
09:30-10:00
Fritz Bökler
Output-Sensitive Complexity of Multiobjective Combinatorial Optimization

Chair:Bernard Fortz
10:30-11:00
Rico Zenklusen
A Strongly Polynomial Algorithm for Bimodular Integer Linear Programming
11:00-11:30
Aleksandr Kazachkov
From Final Point Cuts to V-Polyhedral Cuts
11:30-12:00
Andreas Wierz
A General Analysis of the Primal-Dual Greedy Algorithm

Chair:Robert Weismantel
17:30-18:30
Egon Balas
Recent Developments in Disjunctive Programming
18:30-19:00
Matthias Walter
Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs
19:00-19:30
Lena Hupp
Mixed Integer Reformulations of Robust b-Matching Problems - Using Few Integer Variables


Wednesday 11
Chair:Juan-José Salazar-González
08:30-09:00
Alberto Del Pia
On Decomposability of Multilinear Sets
09:00-09:30
David de Laat
Using Polynomial Optimization to Bound Matrix Factorization Ranks
09:30-10:00
Sven Mallach
Compact Linearization for Binary Quadratic Problems subject to Assignment Constraints

Chair:Annegret Wagler
10:30-11:30
Michele Conforti
The Infinite Models in Integer Programming
11:30-12:00
Tilo Wiedera
Approximation Limits and Algorithms in Practice for the Maximum Planar Subgraph Problem

Chair:Mathieu Van Vyve
17:30-18:30
Andrea Lodi
On (big) data, optimization and learning
18:30-19:00
Fabio Furini
Social Network Analysis and Community Detection by Decomposing a Graph into Relaxed Cliques
19:00-19:30
Achill Schürmann
Linear Symmetries in Integer Convex Optimization


Thursday 12
Chair:Marc Uetz
08:30-09:00
Dirk Oliver Theis
Extension Complexity of Spanning Tree -- Bad News on Lower Bounds
09:00-09:30
Daniel Schmidt
Integer Programming Formulations for the Steiner Forest Problem
09:30-10:00
Pietro Saccardi
Geometric Steiner Tree Packing with Density Constraints

Chair:Karen Aardal
10:30-11:30
Frank Vallentin
Solving Semidefinite Programs for Packing Problems
11:30-12:00
Markus Sinnl
Interdiction Games and Monotonicity

Chair:Gautier Stauffer
17:30-18:30
Martine Labbé
Bilevel Optimisation, Pricing Problems and Stackeberg Games
18:30-19:00
Viktor Bindewald
Robust Assignments with Vulnerable Nodes
19:00-19:30
Miriam Schlöter
Fast and Memory-Efficient Algorithms for Evacuation Problems

Chair:The Organizers
20:45-21:15
Michael Jünger, Gerhard Reinelt, and Giovanni Rinaldi
The Aussois C.O.W.


Friday 13
Chair:Paolo Ventura
08:30-09:00
Joachim Schauer
The Data Arrangement Problem on Binary Trees
09:00-09:30
Michele Monaci
Reformulation Heuristics for Generalized Interdiction Problems
09:30-10:00
Sara Mattia
Staffing and Scheduling Flexible Call Centers by Two-Stage Robust Optimization

Chair:Volker Kaibel
10:30-11:00
Tobias Hofmann
Periodic Event Scheduling and its Industrial Application
11:00-12:00
Jack Edmonds
Understanding EP and PPA: Can it be Hard to Find, if it's Easy to Recognize and you Know it's There?