Portrait of Andrea Lodi

Andrea Lodi

Associate Academic Member
Adjunct Professor, Polytechnique Montréal, Mathematics and Industrial Engineering Department
Founder and Scientific Director, IVADO Labs
Research Topics
Optimization
Google Scholar

Biography

Andrea Lodi is an adjunct professor in the Department of Mathematics and Industrial Engineering at Polytechnique Montréal, and founder and scientific director of IVADO Labs.

Since 2014, Lodi has held the Canada Excellence Research Chair in Data Science for Real-Time Decision-Making at Polytechnique Montréal. This is Canada’s leading research chair in the field of operations research.

Internationally recognized for his work on mixed linear and nonlinear programming, Lodi is focused on developing new models and algorithms to quickly and efficiently process massive amounts of data from multiple sources. These algorithms and models are expected to lead to the creation of optimized real-time decision-making strategies. The goal of his work as Chair is to apply this expertise in a range of sectors, including energy, transport, health, production and supply chain logistics management.

Lodi holds a PhD in systems engineering (2000) and is a full professor of operations research in the Department of Electrical, Electronic and Information Engineering at the University of Bologna. He coordinates large-scale European operations research projects, and has worked as a consultant for the CPLEX R&D team at IBM since 2006. Lodi has published over seventy articles in major journals in mathematical programming and also served as an associate editor for many of these journals.

His many honours include a 2010 Google Faculty Research Award and a 2011 IBM Faculty Award, and he was a member of the prestigious Herman Goldstine program at the IBM Thomas J. Watson Research Center in 2005–2006.

Publications

Measures of balance in combinatorial optimization
Philippe Olivier
Andrea Lodi
Gilles Pesant
2021-06-25
4OR (published)
doi.org
Measures of balance in combinatorial optimization
Philippe Olivier
Andrea Lodi
G. Pesant
2021-06-25
4OR (published)
doi.org
Assessing the Impact: Does an Improvement to a Revenue Management System Lead to an Improved Revenue?
Greta Laage
Emma Frejinger
Andrea Lodi
Guillaume Rabusseau
2021-01-13
ArXiv (preprint)
arxiv.org
arxiv.org
Capacity Expansion in the College Admission Problem
Federico Bobbio
Margarida Carvalho
Andrea Lodi
Alfredo Torrico
2021-01-01
arXiv.org (preprint)
dblp.uni-trier.de
Estimating the Impact of an Improvement to a Revenue Management System: An Airline Application
Greta Laage
Emma Frejinger
William Hamilton
Andrea Lodi
Guillaume Rabusseau
Airlines have been making use of highly complex Revenue Management Systems to maximize revenue for decades. Estimating the impact of changin… (see more)g one component of those systems on an important outcome such as revenue is crucial, yet very challenging. It is indeed the difference between the generated value and the value that would have been generated keeping business as usual, which is not observable. We provide a comprehensive overview of counterfactual prediction models and use them in an extensive computational study based on data from Air Canada to estimate such impact. We focus on predicting the counterfactual revenue and compare it to the observed revenue subject to the impact. Our microeconomic application and small expected treatment impact stand out from the usual synthetic control applications. We present accurate linear and deep-learning counterfactual prediction models which achieve respectively 1.1% and 1% of error and allow to estimate a simulated effect quite accurately.
2021-01-01
arXiv.org (preprint)
dblp.uni-trier.de
Multilevel Approaches for the Critical Node Problem
Andrea Baggio
Margarida Carvalho
Andrea Lodi
Andrea Tramontani
2021-01-01
Operational Research (published)
doi.org
The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights
Maxime Gasse
Simon Bowly
Quentin Cappart
Jonas Charfreitag
Laurent Charlin
Didier Chételat
Antonia Chmiela
Justin Dumouchelle
Ambros Gleixner
Aleksandr Kazachkov
Elias Boutros Khalil
Paweł Lichocki
Andrea Lodi
Miles Lubin
Chris J. Maddison
Christopher Morris
D. Papageorgiou
Augustin Parjadis
Sebastian Pokutta
Antoine Prouvost … (see 22 more)
Lara Scavuzzo
Giulia Zarpellon
Linxin Yangm
Sha Lai
Akang Wang
Xiaodong Luo
Xiang Zhou
Haohan Huang
Sheng Cheng Shao
Yuanming Zhu
Dong Dong Zhang
Tao Manh Quan
Zixuan Cao
Yang Xu
Zhewei Huang
Shuchang Zhou
C. Binbin
He Minggui
Haoren Ren Hao
Zhang Zhiyu
An Zhiwu
Mao Kun
Combinatorial optimization is a well-established area in operations research and computer science. Until recently, its methods have focused … (see more)on solving problem instances in isolation, ignoring that they often stem from related data distributions in practice. However, recent years have seen a surge of interest in using machine learning as a new approach for solving combinatorial problems, either directly as solvers or by enhancing exact solvers. Based on this context, the ML4CO aims at improving state-of-the-art combinatorial optimization solvers by replacing key heuristic components. The competition featured three challenging tasks: finding the best feasible solution, producing the tightest optimality certificate, and giving an appropriate solver configuration. Three realistic datasets were considered: balanced item placement, workload apportionment, and maritime inventory routing. This last dataset was kept anonymous for the contestants.
2021-01-01
NeurIPS (Competition and Demos) (published)
doi.org
arxiv.org
BDD-based optimization for the quadratic stable set problem
Jaime E. González
Andr'e Augusto Cire
Andrea Lodi
Louis-Martin Rousseau
2020-08-01
Discrete Optimization (published)
doi.org
BDD-based optimization for the quadratic stable set problem
Jaime E. González
Andr'e Augusto Cire
Andrea Lodi
Louis-Martin Rousseau
2020-08-01
Discrete Optimization (published)
doi.org
Multi-agent Assortment Optimization in Sequential Matching Markets
Alfredo Torrico
Margarida Carvalho
Andrea Lodi
2020-06-08
ArXiv (preprint)
arxiv.org
arxiv.org
Provable Guarantees for General Two-sided Sequential Matching Markets
Alfredo Torrico
Margarida Carvalho
Andrea Lodi
Two-sided markets have become increasingly more important during the last years, mostly because of their numerous applications in housing, l… (see more)abor and dating. Consumer-supplier matching platforms pose several technical challenges, specially due to the trade-off between recommending suitable suppliers to consumers and avoiding collisions among consumers' preferences. In this work, we study a general version of the two-sided sequential matching model introduced by Ashlagi et al. (2019). The setting is the following: we (the platform) offer a menu of suppliers to each consumer. Then, every consumer selects, simultaneously and independently, to match with a supplier or to remain unmatched. Suppliers observe the subset of consumers that selected them, and choose either to match a consumer or leave the system. Finally, a match takes place if both the consumer and the supplier sequentially select each other. Each agent's behavior is probabilistic and determined by a regular discrete choice model. Our objective is to choose an assortment family that maximizes the expected cardinality of the matching. Given the computational complexity of the problem, we show several provable guarantees for the general model, which in particular, significantly improve the approximation factors previously obtained.
2020-06-08
arXiv.org (preprint)
dblp.uni-trier.de
On generalized surrogate duality in mixed-integer nonlinear programming
Benjamin Müller
Gonzalo Muñoz
Maxime Gasse
Ambros Gleixner
Andrea Lodi
Felipe Serrano
2020-04-14
Integer Programming and Combinatorial Optimization (published)
doi.org
arxiv.org