Upcoming Talks


Past Talks


Date Presenter Title
Nov, 22th 2022 Matthias Brugger (TUM) Circuits in Extended Formulations
Sep, 13th 2022 Alexander Black (UC Davis) Small Shadows of Lattice Polytopes 
June, 21st 2022 Teodora Dobos Classical and Modern Approaches for Solving the Steiner Tree Problem
May,11th 2022 Lukas Brandl (TUM) A Strengthening of the Gomory-Chvátal Cutting-Plane Procedure for 0/1-Polytopes


Date Presenter Title
Nov, 9th 2021 Laiba Mudusar   
July, 20th 2021 Alper Taskiran Iterative Combinatorial Auctions: Improved Running Time via Machine Learning
June, 22nd 2021 Leander Schnaars
(TU München)
Concurrent Open Shop and Coflow Scheduling
June, 11th 2021 Jessica Reichelt
(TU München)
Large Neighborhood Search Algorithms for Full Load Vehicle Routing
Feb, 16th 2021 Simon Gmeiner
(TU München)
Robust Appointment Scheduling and the Airplane Refueling Problem


Date Presenter Title
Dec, 11th 2020 Sarah Roth
(FU Berlin)
SAT Heuristics for the Periodic Event Scheduling Problem
Dec, 8th 2020 Papatya S. Bıçakcı
(Baskent University)
Solution approaches for the parallel machine order acceptance and scheduling problem with sequence-dependent setup times, release dates and deadlines
Dec, 4th 2020 Martin Glanzer
(TU Wien)

Multistage stochastic optimization: multiple time scales and model ambiguity

Nov, 27th 2020 Fabian Pieroth
(TU München)
Influence-guided communication in multi-agent networks
Oct, 23rd 2020 Gregor Matl
(University of Oxford)
The Bounded Generalized Min-Cut Problem
Sep, 25th 2020 Daniel Vaz
(TU München)
Vertex Sparsification for Edge Connectivity
Sep, 18th 2020 Marcus Kaiser
(TU München)
Computation of Dynamic Equilibria in Series-Parallel Networks
Sep, 4th 2020

Martin Wiesner

(TU München)

Location Under Competition in Free-Floating Carsharing
Jun 18th, 2020

Erik Martori López

(TU München)

Smoothed complexity on the local max-cut problem

Jun 5th, 2020

Gianluca Ralli
(TU München)

Strategic Contention Resolution with Limited Feedback

Jun 2nd, 2020

Alexander Hammerl
(TU München)
Truthful scheduling of unrelated machines

May 11th, 2020

Alexandros Tsigonias-Dimitriadis
(TU München)

On prophets and secretaries with binomial sampling

Apr 2nd, 2020

Pratibha Choudhary
(Indian Institute of Technology Jodhpur)


Mar 2nd, 2020 David James
(TU München)
Optimizing Multiple Linear Regression through Integer Programming
Feb 7th, 2020 Matías Villagra
(P. Universidad Católica de Chile)
On a canonical symmetry breaking technique for polytopes



Oct 16th, 2019 Thomas Lidbetter
(Rutgers Business School)
Submodular Search and Machine Scheduling
Oct 10th, 2019 Benedikt Plank
(TU München)
Full Truckload Routing in the Logistics Industry
Oct 10th, 2019 Florian Pawlik
(TU München)
New Methods for Transplantation Planning in Realistic Kidney Exchange Networks
Jul 24th, 2019 Lukas Stevens
(TU München)
Vehicle Routing in the Trucking Industry
Jul 3rd, 2019 Anna-Lena Rösler
(TU München)
Pareto Optimal Matchings
Apr 10th, 2019 Patrick Lederer
(TU München)
Approximation Algorithms for Scheduling Jobs with Precedence Constraints and Release Dates
Apr 4th, 2019 Aris Filos-Ratsikas
Natural PPA-complete problems: Necklace Splitting, Consensus Halving and Discrete Ham Sandwich
Mar 27th, 2019 Matthias Brugger
(TU München)
On the Sizes of Linear Programming Formulations for Scheduling
Mar 14th, 2019 Stratis Skoulakis
Opinion Dynamics with Limited Information
Feb 28th, 2019 Philip Münch
(TU München)
Ability-Based Machine Configuration
Jan 10th, 2019 S. Ahmad Mojallal
(Sungkyunkwan University)
Laplacian Energy of Graphs


Dec 13th, 2018 Marcus Kaiser
(TU München)
Budget Minimization with Precedence Constraints
Dec 6th, 2018 Antonia Demletiner
(TU München)
Approximation Algorithms for Location Routing with Depot Capacities
Nov 30th, 2018 Benedikt Plank
(TU München)
Stochastic Score Classification
Nov 29th, 2018 Clara Waldmann
(TU München)
The Tree Augmentation Problem
Nov 23rd, 2018 Felix Happach
(TU München)
Scheduling with OR-Precedence Constraints
Nov 9th, 2018 Andrés Fielbaum
(Universidad de Chile)
Optimal design for a public transport bus system considering routes, frequencies and vehicle sizes in a general city model
Nov 8th, 2018 Ulf Friedrich
(TU München)
Integer programming as a problem in complex analysis
Nov 8th, 2018 Marinus Gottschau
(TU München)
Influencing Opinion Formation
Oct 25th, 2018 Klaus Jansen
(Uni Kiel)
Empowering the Configuration-IP --- New PTAS Results for Scheduling with Setups Times
Oct 18th, 2018 Rebecca Reiffenhäuser (RWTH Aachen) An Optimal Truthful Mechanism for the Online Weighted Bipartite Matching Problem
Oct 5th, 2018 Marilena Leichter
(TU München)
On the Minimum Hitting Set of Bundles Problem
Oct 4th, 2018 Marcus Kaiser
(TU München)
Thin Flows with Resetting in Series-Parallel Networks
Sep 20th, 2018 Martin Bullinger
(TU München)
Polynomial-time instances of PLS-complete problems
Sep 11th, 2018 Ulrike Schmidt-Kraepelin
(TU München)
Maintaining perfect matchings
Aug 7th, 2018 Daniel R. Schmidt
(Universität zu Köln)
An exact algorithm for the Steiner forest problem
Aug 7th, 2018 Melanie Schmidt
(Universität Bonn)
Analysis of Ward’s method
Jul 26th, 2018 Miriam Schlöter
(TU Berlin)
Flows Over Time and Submodular Function Minimization
Jun 13th, 2018 Maximilian Schiffer
(RWTH Aachen)
Real-world picker routing problems in mixed shelves warehouses of online retailers
Jun 7th, 2018 Layla Martin
(TU München)
The Competitive Pickup and Delivery Orienteering Problem for Rebalancing Carsharing Systems
May 24th, 2018 Christian Biefel
(TU München)
The Net Present Value Problem
May 17th, 2018 Jonas Ide
Examples of Optimization in Industry
May 8th, 2018 Kevin Schewior
(TU München)
On the Traveling Salesperson Problem with Neighborhoods
Apr 19th, 2018 Marilena Leichter
(TU München)
On Some Subgraph Restricted Matchings
Mar 21st, 2018 Stefan Ehard
(Ulm University)
Dynamic Monopolies and Vaccination
Mar 16th, 2018 Viktor Bindewald
(TU Dortmund)
Robust Bipartite Matchings With Edge and Node Failures
Mar 16th, 2018 Matthias Brugger
(TU München)
Extended Formulations of Polyhedra: How Many Inequalities Do We Need?
Mar 9th, 2018 Stefan Weltge
(TU München)
How many integer variables do we need?
Mar 2nd, 2018 Dennis Dayanikli
(TU Universität Ulm)
A pursuit-evasion game on graphs
Feb 26th, 2018 Michal Moshkovitz
(Hebrew University of Jerusalem)
Mixing Implies Lower Bounds for Space Bounded Learning
Feb 23rd, 2018 Daniela Vögler
(TU München)
Breaking the curse of dimension in multi-marginal Kantorovich optimal transport on finite state spaces
Jan 19th, 2018 Aleksei Kuvshinov
(TU München)
Convex optimization under uncertainty: distributionally robust optimization framework
Jan 18th, 2018 Arindam Khan
(TU München)
Approximating Geometric Knapsack via L-packings


Dec 21st, 2017 Steffen Borgwardt
(UC Denver)
An Introduction to Discrete Barycenters
Dec 15th, 2017 Alexander Eckl
(TU München)
Variations of the Robust Flow Problem
Dec 8th, 2017 Arslan Ali Syed
On Demand Mobility and Dynamic Ride Sharing Problem
Nov 24th, 2017 Ingo Stallknecht
(Heidelberg University)
Polynomial integer programming as projection
Nov 17th, 2017 Simone Maria Massaccesi
(LMU München)
When a random simple graph with a fixed degree sequence has a giant component
Nov 17th, 2017 Andrea Haertle
(TU München)
Live Kidney Transplantation in Germany: A Proposal for a Kidney Exchange System
Nov 10th, 2017 Isabella Listl
(TU München)
Homeless Shelter placement using priority queues
Oct 18th, 2017 Bastián Bahamondes
(Universidad de Chile)
Adaptivity in Network Interdiction
Oct 13th, 2017 Martina Kuchlbauer
(TU München)
Parametric Combinatorial Optimization Problems and their Complexity
Sep 11th, 2017 Kshitij Gajjar
(Tata Institute of Fundamental Research)
Distance-preserving Subgraphs of Interval Graphs
Jul 26th, 2017 Jose Soto
(Universidad de Chile)
Strong algorithms for the ordinal matroid secretary problem
Jul 19th, 2017 Martin Zellner
(TU München)
Clustering Directed Graphs (Bachelor's thesis)
Jul 19th, 2017 Diogo Pocas
(McMaster University)
Analog Networks on Function Data Streams
Jul 12th, 2017 Katie Fitch
(TU München)
A Metric Preserving Symmetrization Method for Directed Networks
Jun 28th, 2017 Jannik Matuschke
(TU München)
Rerouting Flows when Links Fail
Jun 21st, 2017 Kristof Bauer
(TU München)
Combinatorial approaches to Prize-Collecting Graph Problems (Master's thesis)
May 24th, 2017 Nicola Pace
(TU München)
Permutation decoding of linear codes
May 17th, 2017 Yiannis Giannakopoulos
(TU München)
Duality Theory for Optimal Multidimensional Auctions
May 15th, 2017 Abhishek Rathod
(TU München)
Approximation Algorithms for Max Morse Matching
Mar 24th, 2017 Daniel Schmidt gen. Waldschmidt
(TU München)
Scheduling with Position-Dependent Speed (Master's thesis)
Mar 17th, 2017 Ruben Hoeksma
(Universidad de Chile)
Posted price mechanisms for a random stream of customers
Mar 10th, 2017 Haakon Rød
(TU München)
A Distributed Algorithm for Large-scale Stochastic Optimization Problems
Feb 14th, 2017 Ashwin Arulselvan
(University of Strathclyde)
Economic lot sizing problem with remanufacturing option
Feb 10th, 2017 Victor Verdugo
(Universidad de Chile)
Integrality Gaps for Identical Machines Scheduling
Jan 24th, 2017 Marinus Gottschau
(TU München)
Bootstrap Percolation on Degenerate Graphs
Jan 23rd, 2017 Yossi Luzon
(Tel Aviv University)
Scheduling and Control of Two Fundamental Processing Systems


Dec 19th, 2016 Michele Garraffa
(Université Paris 13)
An Exact Exponential Branch-and-Merge Algorithm for the Single Machine Total Tardiness Problem
Dec 7th, 2016 Jiehua Chen
(TU Berlin)
Teams in Online Scheduling Polls: Game-Theoretic Aspects
Dec 2nd, 2016 Felix Happach
(TU München)
Stable Clusterings and the Cones of Outer Normals
Nov 25th, 2016 Jannik Matuschke
(TU München)
Robust Flows
Nov 18th, 2016 Marcus Kaiser
(TU München)
Optimal Integration of Autonomous Vehicles in Car Sharing
Nov 11th, 2016 Katie Fitch
(TU München)
Optimal leader selection in multi-agent networks: joint centrality, robustness, and controllability
Oct 28th, 2016 José Soto
(Universidad de Chile)
Independent Sets of Rectangles Intersecting a Diagonal Line
Jul 18th, 2016 Rajan Udwani
Robust Monotone Submodular Function Maximization
Jul 18th, 2016 Yassine Marrakchi
Multi-Target-Tracking for sorting bulk materials
Jun 27th, 2016 Senanayak Sesh Kumar Karri
(INRIA Paris)
Learning bounded treewidth de- composable graphs to maximize submodular functions
May 30th, 2016 Sergei Chubanov
(Universität Siegen)
Polynomial projection algorithm with applications in combinatorial optimization
Apr 18th, 2016 Kai Kellner
(Goethe-Universität Frankfurt/Main)
Containment problems for projections of polyhedra and spectrahedra
Feb 29th, 2016 Andreas Wiese
(MPI Saarbrücken)
Better Approximation Guarantees for Geometric Packing Problems