Keynote speakers

Hande Yaman received her B.S. and M.S. degrees in Industrial Engineering from Bilkent University in 1997 and 1999, and her Ph.D. degree in Operations Research from Universite Libre de Bruxelles in 2002. She worked at the Department of Industrial Engineering at Bilkent University from 2003 to 2018. She spent a year as a visiting researcher at CORE, Universite catholique de Louvain. She is currently a professor at the Faculty of Economics and Business at KU Leuven. Her research interests are in polyhedral approaches for integer programming with applications in production planning, logistics, and network design.

Topic: Hub Location Problems: Applications, Models and Solution Methods
Hubbing is commonly used in airlines, cargo delivery and telecommunications networks where traffic from many origins to many destinations are consolidated at hubs and are routed together to benefit from economies of scale. Each application area has its specific features and the associated hub location problems are of complex nature. In the first part of this talk, I will introduce the basic hub location problems, present the important models and mention the shortcomings of these in addressing real life situations. In the second part, I will introduce new variants of the hub location problem that incorporate features such as hierarchical and multimodal networks, service of quality constraints, generalized allocation strategies and demand uncertainty. I will conclude the talk with an ongoing work on a joint problem of hub location and network dimensioning.

Pascal Van Hentenryck is an A. Russell Chandler III Chair and Professor in the H. Milton Stewart School of Industrial and Systems Engineering at Georgia Tech. Prior to this appointment, he was a professor of Computer Science at Brown University for about 20 years, he led the optimization research group (about 70 people) at National ICT Australia (NICTA) (until its merger with CSIRO), and was the Seth Bonder Collegiate Professor of Engineering at the University of Michigan. Van Hentenryck is also an Honorary Professor at the Australian National University.

Topic: Scalable On-Demand Mobility Services
The convergence of several technology enablers, including ubiquitous connectivity, autonomous vehicles, and sophisticated analytics, provides unique opportunities to fundamentally transform mobility in the next decade. Ride-sourcing services have already modernized taxi services but they have also increased congestion and widened inequalities in accessibility. This talk looks at mobility from a logistics and supply chain angle and presents novel on-demand mobility services that have the potential to be scalable and sustainable, handling both the first/last mile problem and congestion. Case studies demonstrating novel mobility services will also be presented.

Rico Zenklusen obtained a master's degree from EPFL and a PhD from ETH Zurich, both in Mathematics. After a short postdoctoral research stay at EPFL and several years as a postdoctoral researcher at MIT, he first joined the faculty of the Johns Hopkins University before moving to ETH Zurich. At ETH Zurich, Rico is currently an Assistant Professor in Mathematics, heading the Combinatorial Optimization group. He is on the Editorial Boards of Mathematics of Operations Research, Mathematical Programming, and ACM Transactions on Algorithms, and regularly serves on program and scientific committees of conferences on Mathematical Optimization and Theoretical Computer Science. Rico has broad research interests in Combinatorial Optimization and its applications, and enjoys working at the interface of Mathematical Optimization, Theoretical Computer Science, and Operations Research.

Topic: Analyzing Network Robustness via Interdiction Problems
How susceptible is a network to failures of some of its components? What are the weakest spots of a networked system? These questions lie at the heart of interdiction problems, which seek to determine the maximum impact that the failure/removal of a limited number of edges/vertices can have on the performability of a network. Interdiction problems are a natural way to measure robustness. Furthermore, they give valuable insights in how to best improve the failure resilience of a system, and sometimes, how to best attack it.

In this talk, I will first provide a general introduction to interdiction problems, showing some of their varied, and sometimes surprising, applications. I will then discuss, on specific examples, optimization techniques that allow for approaching a variety of interdiction problems.

Online user: 1