![]() |
Lun. 06 | Mar. 07 | Mer. 08 | Jeu. 09 | Ven. 10 |
08:00
09:00
10:00
11:00
12:00
13:00
14:00
15:00
16:00
17:00
18:00
19:00
|
8:15 - 8:30 (15min)
Welcome
![]() The organizers
8:30 - 9:30 (1h)
Focus Lecture
![]() Gautier Staufer
› Single-Source Unsplittable Flows in Planar and Bounded Genus Graphs
- Laura Vargas-Koch, RWTH Aachen
08:30-09:30 (1h)
9:30 - 10:15 (45min)
Présentation régulière (~20 min)
![]() Gautier Staufer
› Finding tight and compact models for energy system modeling
- Maaike Elgersma, Delft University of Technology
09:50-10:10 (20min)
10:15 - 10:45 (30min)
Pause café
10:45 - 11:05 (20min)
Présentation régulière (~20 min)
![]() Paolo Ventura
› Complexity of Injectivity and Verification of ReLU Neural Networks
- Martin Skutella, TU Berlin
10:45-11:05 (20min)
11:05 - 12:05 (1h)
Elevator pitch (~3min)
![]() Paolo Ventura
16:15 - 16:45 (30min)
Pause café
16:45 - 17:45 (1h)
Focus Lecture
![]() Giovanni Rinaldi
› Solving train scheduling problems: reformulations, decompositions, and practice
- Carlo Mannino, SINTEF, Oslo
16:45-17:45 (1h)
17:45 - 18:15 (30min)
Pause café
18:15 - 18:35 (20min)
Présentation régulière (~20 min)
![]() Volker Kaibel
› Neural Networks and (Virtual) Extended Formulations
- Christoph Hertrich, Université libre de Bruxelles
18:15-18:35 (20min)
18:35 - 19:15 (40min)
Elevator pitch (~3min)
![]() Volker Kaibel
|
8:30 - 9:30 (1h)
Focus Lecture
![]() Karen Aardal
9:30 - 10:15 (45min)
Présentation régulière (~20 min)
![]() Karen Aardal
› On the Number of Degenerate Simplex Pivots
- Kirill Kukharenko, Otto-von-Guericke-Universität Magdeburg = Otto-von-Guericke University [Magdeburg]
09:30-09:50 (20min)
› Stronger adversaries grow cheaper forests: Online Node-Weighted Steiner Problems
- Sander Borst, Max Planck Institute for Informatics
09:50-10:10 (20min)
10:15 - 10:45 (30min)
Pause café
10:45 - 12:05 (1h20)
Présentation régulière (~20 min)
![]() Marc Pfetsch
› Algorithmic Advances for Global Routing in VLSI Design
- Daniel Blankenburg, Universität Bonn = University of Bonn
11:05-11:25 (20min)
› Common misbeliefs when working with total unimodularity
- Matthias Walter, University of Twente
11:25-11:45 (20min)
› Complexity of Integer Programming in Reverse Convex Sets via Boundary Hyperplane Cover
- Robert Hildebrand, Virginia Tech [Blacksburg]
11:45-12:05 (20min)
16:15 - 17:00 (45min)
Pause cafe
17:00 - 18:00 (1h)
Focus Lecture
![]() Andrea Lodi
› Anticlustering for large scale clustering
- Veronica Piccialli, Sapienza, Università di Roma
17:00-18:00 (1h)
18:00 - 18:15 (15min)
Pause café
18:15 - 19:15 (1h)
Présentation régulière (~20 min)
![]() Alexandra Lassota
› A simple quadratic kernel for Token Jumping on surfaces
- Benjamin Peyrille, Laboratoire des sciences pour la conception, lóptimisation et la production
18:15-18:35 (20min)
› Corner Benders' Cuts
- Ricardo Fukasawa, Combinatorics and Optimization [Waterloo]
18:35-18:55 (20min)
› Decision focused learning for combinatorial and contextual stochastic optimization
- Axel Parmentier, Centre dÉnseignement et de Recherche en Mathématiques et Calcul Scientifique
18:55-19:15 (20min)
|
8:30 - 9:30 (1h)
Focus Lecture
![]() Christoph Helmberg
9:30 - 10:15 (45min)
Présentation régulière (~20 min)
Christoph Helmberg
› A characterization of unimodular hypergraphs with disjoint hyperedges
- Meike Neuwohner, Department of Mathematics London School of Economics
09:30-09:50 (20min)
› Totally Δ-modular IPs with two non-zeros in most rows
- Stefan Kober, Université Libre de Bruxelles
09:50-10:10 (20min)
10:15 - 10:45 (30min)
Pause café
10:45 - 12:05 (1h20)
Présentation régulière (~20 min)
![]() Sophie Huiberts
› Efficient and effective optimization methods for sparse generalized inverses
- Jon Lee, University of Michigan
10:45-11:05 (20min)
› Faster Lattice Basis Computation via a Natural Generalization of the Euclidean Algorithm
- Kim-Manuel Klein, Universität zu Lübeck = University of Lübeck [Lübeck]
11:05-11:25 (20min)
› Machine Learning + Operations Research for optimal counterfactual controller in wind turbines
- Martina Fischetti, University of Seville
11:45-12:05 (20min)
16:15 - 17:00 (45min)
Pause café
17:00 - 18:00 (1h)
Focus Lecture
![]() Leen Stougie
› Recent advances in solving multistage stochastic mixed-integer programs
- Merve Bodur, University of Edinburgh
17:00-18:00 (1h)
18:00 - 18:15 (15min)
Pause café
18:15 - 19:15 (1h)
Présentation régulière (~20 min)
![]() Neil Olver
› Machine Learning for Faster Dynamic Graph Algorithms
- Benjamin Moseley, Carnegie Mellon University [Pittsburgh]
18:15-18:35 (20min)
› Optimization techniques for modeling with piecewise-linear functions
- Tamas Kis, HUN-REN Institute for Computer Science and Control
18:35-18:55 (20min)
› Recognizing integrality of weighted rectangles partitions
- Ulf Friedrich, Otto-von-Guericke University Magdeburg
18:55-19:15 (20min)
|
8:30 - 9:30 (1h)
Focus Lecture
![]() Nicole Megow
› Computational Approaches for Mixed Integer Bilevel Optimization
- Ivana Ljubic, ESSEC Business School of Paris
08:30-09:30 (1h)
9:30 - 10:15 (45min)
Présentation régulière (~20 min)
![]() Nicole Megow
› An improved (strongly polynomial) combinatorial algorithm for the nucleolus in Convex Games
- Giacomo Maggiorano, Université de Lausanne = University of Lausanne
09:30-09:50 (20min)
› Global One-sided Parabolic Approximations for MINLP
- Adrian G¨oß, University of Technology Nuremberg (UTN)
09:50-10:10 (20min)
10:15 - 10:45 (30min)
Pause café
10:45 - 12:05 (1h20)
Présentation régulière (~20 min)
![]() Gerard Cornuejols
› Sequential Linear Contracts Under Matroid Constraints
- Kanstantsin Pashkovich, University of Waterloo [Waterloo]
11:05-11:25 (20min)
› The Bidirected Cut Relaxation for Steiner Tree has Integrality Gap Smaller than 2
- Jaroslaw Byrka, University of Wroclaw
11:25-11:45 (20min)
› The Differentiable Feasibility Pump
- Antonio Frangioni, University of Pisa
11:45-12:05 (20min)
16:15 - 17:00 (45min)
Pause café
17:00 - 18:00 (1h)
Focus Lecture
![]() Tom McCormick
› Generalized list matrix partition problems from the viewpoint of graph width parameters
- Flavia Bonomo, Universidad de Buenos Aires
17:00-18:00 (1h)
18:00 - 18:15 (15min)
Pause café
18:15 - 19:15 (1h)
Présentation régulière (~20 min)
Ola Svensson
› An a posteriori analysis of numerical correctness in LP-based branch and bound
- Ambros Gleixner, HTW & Zuse Institute Berlin
18:15-18:35 (20min)
› Polynomial Matrices in Integer Programming with Restricted Subdeterminants
- Stefan Kuhlmann, ETH Zurich
18:35-18:55 (20min)
› Avoiding Deadlocks via Weak Deadlocks
- Gianpaolo Oriolo, Università degli Studi Tor Vergata
18:55-19:15 (20min)
|
8:30 - 9:30 (1h)
Focus Lecture
![]() Marc Uetz
› Recent Results for Robust Flows and Network Interdiction Games
- Jannik Matuschke, U Leuven
08:30-09:30 (1h)
9:30 - 10:15 (45min)
Présentation régulière (~20 min)
![]() Marc Uetz
› Heuristic Methods for Γ-Robust Mixed-Integer Linear Bilevel Problems
- Yasmine Beck, Essec Business School
09:30-09:50 (20min)
› On the complexity of the odd-red bipartite perfect matching polytope
- Martin Nägele, Department of Mathematics, ETH Zurich
09:50-10:10 (20min)
10:15 - 10:45 (30min)
Pause café
10:45 - 12:05 (1h20)
Présentation régulière (~20 min)
![]() Britta Peis
› Spanning Trees by Splitting Variables
- Angelika Wiegele, Institut für Mathematik, Alpen-Adria-Universität Klagenfurt, Austria
11:05-11:25 (20min)
› Unsplittable Transshipments
- SRINWANTI DEBGUPTA, Technical University of Berlin / Technische Universität Berlin, Berlin Mathematical School, MATH+
11:25-11:45 (20min)
› Generalized Assignment and Knapsack Problems in the Random-Order Model
- Max Klimm, TU Berlin
11:45-12:05 (20min)
|