Programme
Heures |
événement |
(+)
|
08:30 - 09:30
|
Focus Lecture (Main lecture room) - Karen Aardal |
(+)
|
08:30 - 09:30 |
› Cutting planes and Fixed Parameter Tractability - Fritz Eisenbrand, EPF Lausanne |
|
09:30 - 10:15
|
Présentation régulière (~20 min) (Main lecture room) - Karen Aardal |
(+)
|
09:30 - 09:50 |
› On the Number of Degenerate Simplex Pivots - Kirill Kukharenko, Otto-von-Guericke-Universität Magdeburg = Otto-von-Guericke University [Magdeburg] |
|
09:50 - 10:10 |
› Stronger adversaries grow cheaper forests: Online Node-Weighted Steiner Problems - Sander Borst, Max Planck Institute for Informatics |
|
10:15 - 10:45
|
Pause café |
|
10:45 - 12:05
|
Présentation régulière (~20 min) (Main lecture room) - Marc Pfetsch |
(+)
|
10:45 - 11:05 |
› Tropical medians by transportation - Michael Joswig, TU Berlin |
|
11:05 - 11:25 |
› Algorithmic Advances for Global Routing in VLSI Design - Daniel Blankenburg, Universität Bonn = University of Bonn |
|
11:25 - 11:45 |
› Common misbeliefs when working with total unimodularity - Matthias Walter, University of Twente |
|
11:45 - 12:05 |
› Complexity of Integer Programming in Reverse Convex Sets via Boundary Hyperplane Cover - Robert Hildebrand, Virginia Tech [Blacksburg] |
|
16:15 - 17:00
|
Pause cafe |
|
17:00 - 18:00
|
Focus Lecture (Main lecture room) - Andrea Lodi |
(+)
|
17:00 - 18:00 |
› Anticlustering for large scale clustering - Veronica Piccialli, Sapienza, Università di Roma |
|
18:00 - 18:15
|
Pause café |
|
18:15 - 19:15
|
Présentation régulière (~20 min) (Main lecture room) - Alexandra Lassota |
(+)
|
18:15 - 18:35 |
› A simple quadratic kernel for Token Jumping on surfaces - Benjamin Peyrille, Laboratoire des sciences pour la conception, lóptimisation et la production |
|
18:35 - 18:55 |
› Corner Benders' Cuts - Ricardo Fukasawa, Combinatorics and Optimization [Waterloo] |
|
18:55 - 19:15 |
› Decision focused learning for combinatorial and contextual stochastic optimization - Axel Parmentier, Centre dÉnseignement et de Recherche en Mathématiques et Calcul Scientifique |
|
Heures |
événement |
(+)
|
08:30 - 09:30
|
Focus Lecture (Main lecture room) - Christoph Helmberg |
(+)
|
08:30 - 09:30 |
› Ghost Value Augmentation for k-Edge-Connectivity - Rico Zenklusen, ETH Zurich |
|
09:30 - 10:15
|
Présentation régulière (~20 min) - Christoph Helmberg |
(+)
|
09:30 - 09:50 |
› A characterization of unimodular hypergraphs with disjoint hyperedges - Meike Neuwohner, Department of Mathematics London School of Economics |
|
09:50 - 10:10 |
› Totally Δ-modular IPs with two non-zeros in most rows - Stefan Kober, Université Libre de Bruxelles |
|
10:15 - 10:45
|
Pause café |
|
10:45 - 12:05
|
Présentation régulière (~20 min) (Main lecture room) - Sophie Huiberts |
(+)
|
10:45 - 11:05 |
› Efficient and effective optimization methods for sparse generalized inverses - Jon Lee, University of Michigan |
|
11:05 - 11:25 |
› 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:25 - 11:45 |
› Kissing Polytopes - Antoine Deza, McMaster University |
|
11:45 - 12:05 |
› Machine Learning + Operations Research for optimal counterfactual controller in wind turbines - Martina Fischetti, University of Seville |
|
16:15 - 17:00
|
Pause café |
|
17:00 - 18:00
|
Focus Lecture (Main lecture room) - Leen Stougie |
(+)
|
17:00 - 18:00 |
› Recent advances in solving multistage stochastic mixed-integer programs - Merve Bodur, University of Edinburgh |
|
18:00 - 18:15
|
Pause café |
|
18:15 - 19:15
|
Présentation régulière (~20 min) (Main lecture room) - Neil Olver |
(+)
|
18:15 - 18:35 |
› Machine Learning for Faster Dynamic Graph Algorithms - Benjamin Moseley, Carnegie Mellon University [Pittsburgh] |
|
18:35 - 18:55 |
› Optimization techniques for modeling with piecewise-linear functions - Tamas Kis, HUN-REN Institute for Computer Science and Control |
|
18:55 - 19:15 |
› Recognizing integrality of weighted rectangles partitions - Ulf Friedrich, Otto-von-Guericke University Magdeburg |
|
Heures |
événement |
(+)
|
08:30 - 09:30
|
Focus Lecture (Main lecture room) - Nicole Megow |
(+)
|
08:30 - 09:30 |
› Computational Approaches for Mixed Integer Bilevel Optimization - Ivana Ljubic, ESSEC Business School of Paris |
|
09:30 - 10:15
|
Présentation régulière (~20 min) (Main lecture room) - Nicole Megow |
(+)
|
09:30 - 09:50 |
› An improved (strongly polynomial) combinatorial algorithm for the nucleolus in Convex Games - Giacomo Maggiorano, Université de Lausanne = University of Lausanne |
|
09:50 - 10:10 |
› Global One-sided Parabolic Approximations for MINLP - Adrian G¨oß, University of Technology Nuremberg (UTN) |
|
10:15 - 10:45
|
Pause café |
|
10:45 - 12:05
|
Présentation régulière (~20 min) (Main lecture room) - Gerard Cornuejols |
(+)
|
10:45 - 11:05 |
› Robust Generalized Nash Equilibria - Mattia Sara, CNR-IASI |
|
11:05 - 11:25 |
› Sequential Linear Contracts Under Matroid Constraints - Kanstantsin Pashkovich, University of Waterloo [Waterloo] |
|
11:25 - 11:45 |
› The Bidirected Cut Relaxation for Steiner Tree has Integrality Gap Smaller than 2 - Jaroslaw Byrka, University of Wroclaw |
|
11:45 - 12:05 |
› The Differentiable Feasibility Pump - Antonio Frangioni, University of Pisa |
|
16:15 - 17:00
|
Pause café |
|
17:00 - 18:00
|
Focus Lecture (Main lecture room) - Tom McCormick |
(+)
|
17:00 - 18:00 |
› Generalized list matrix partition problems from the viewpoint of graph width parameters - Flavia Bonomo, Universidad de Buenos Aires |
|
18:00 - 18:15
|
Pause café |
|
18:15 - 19:15
|
Présentation régulière (~20 min) - Ola Svensson |
(+)
|
18:15 - 18:35 |
› An a posteriori analysis of numerical correctness in LP-based branch and bound - Ambros Gleixner, HTW & Zuse Institute Berlin |
|
18:35 - 18:55 |
› Polynomial Matrices in Integer Programming with Restricted Subdeterminants - Stefan Kuhlmann, ETH Zurich |
|
18:55 - 19:15 |
› Avoiding Deadlocks via Weak Deadlocks - Gianpaolo Oriolo, Università degli Studi Tor Vergata |
|
Heures |
événement |
(+)
|
08:30 - 09:30
|
Focus Lecture (Main lecture room) - Marc Uetz |
(+)
|
08:30 - 09:30 |
› Recent Results for Robust Flows and Network Interdiction Games - Jannik Matuschke, U Leuven |
|
09:30 - 10:15
|
Présentation régulière (~20 min) (Main lecture room) - Marc Uetz |
(+)
|
09:30 - 09:50 |
› Heuristic Methods for Γ-Robust Mixed-Integer Linear Bilevel Problems - Yasmine Beck, Essec Business School |
|
09:50 - 10:10 |
› On the complexity of the odd-red bipartite perfect matching polytope - Martin Nägele, Department of Mathematics, ETH Zurich |
|
10:15 - 10:45
|
Pause café |
|
10:45 - 12:05
|
Présentation régulière (~20 min) (Main lecture room) - Britta Peis |
(+)
|
10:45 - 11:05 |
› A Decomposition Theorem for Dynamic Flows - Tobias Harks, Passau University |
|
11:05 - 11:25 |
› Spanning Trees by Splitting Variables - Angelika Wiegele, Institut für Mathematik, Alpen-Adria-Universität Klagenfurt, Austria |
|
11:25 - 11:45 |
› Unsplittable Transshipments - SRINWANTI DEBGUPTA, Technical University of Berlin / Technische Universität Berlin, Berlin Mathematical School, MATH+ |
|
11:45 - 12:05 |
› Generalized Assignment and Knapsack Problems in the Random-Order Model - Max Klimm, TU Berlin |
|
|