55 citations · 99 across the 18 of their papers we have counts for
27 papers
MIP-GNN: A Data-Driven Framework for Guiding Combinatorial Solvers
Elias B. Khalil, Christopher Morris, Andrea Lodi
Mixed-integer programming (MIP) technology offers a generic way of formulating and solving combinatorial optimization problems. While generally reliable, state-of-the-art MIP solve…
Capacity Variation in the Many-to-one Stable Matching
Federico Bobbio, Margarida Carvalho, Andrea Lodi +1
The many-to-one stable matching problem provides the fundamental abstraction of several real-world matching markets such as school choice and hospital-resident allocation. The agen…
The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights
Maxime Gasse, Quentin Cappart, Jonas Charfreitag +38
Combinatorial optimization is a well-established area in operations research and computer science. Until recently, its methods have focused on solving problem instances in isolatio…
Machine-learning-based arc selection for constrained shortest path problems in column generation
Mouad Morabit, Guy Desaulniers, Andrea Lodi
Column generation is an iterative method used to solve a variety of optimization problems. It decomposes the problem into two parts: a master problem, and one or more pricing probl…
Guidelines for the Computational Testing of Machine Learning approaches to Vehicle Routing Problems
Luca Accorsi, Andrea Lodi, Daniele Vigo
Despite the extensive research efforts and the remarkable results obtained on Vehicle Routing Problems (VRP) by using algorithms proposed by the Machine Learning community that are…
On the estimation of discrete choice models to capture irrational customer behaviors
Sanjay Dominik Jena, Andrea Lodi, Claudio Sole
The Random Utility Maximization model is by far the most adopted framework to estimate consumer choice behavior. However, behavioral economics has provided strong empirical evidenc…