249 citations · 790 across the 59 of their papers we have counts for
6 papers · 1 filter
An improved column-generation-based matheuristic for learning classification trees
Krunal Kishor Patel, Guy Desaulniers, Andrea Lodi
Decision trees are highly interpretable models for solving classification problems in machine learning (ML). The standard ML algorithms for training decision trees are fast but gen…
Assortment Optimization with Visibility Constraints
Theo Barre, Omar El Housni, Marouane Ibn Brahim +2
Motivated by applications in e-retail and online advertising, we study the problem of assortment optimization under visibility constraints, that we refer to as APV. Here, we are gi…
Integer Programming Games: A Gentle Computational Overview
Margarida Carvalho, Gabriele Dragotto, Andrea Lodi +1
In this tutorial, we present a computational overview on computing Nash equilibria in Integer Programming Games (s), , how to compute solutions for a class of non-cooper…
Operational Research: Methods and Applications
Fotios Petropoulos, Gilbert Laporte, Emel Aktas +79
Throughout its history, Operational Research has evolved to include a variety of methods, models and algorithms that have been applied to a diverse and wide range of contexts. This…
The Critical Node Game
Gabriele Dragotto, Amine Boukhtouta, Andrea Lodi +1
In this work, we introduce a game-theoretic model that assesses the cyber-security risk of cloud networks and informs security experts on the optimal security strategies. Our appro…
Recovering Dantzig-Wolfe Bounds by Cutting Planes
Rui Chen, Oktay Gunluk, Andrea Lodi
Dantzig-Wolfe (DW) decomposition is a well-known technique in mixed-integer programming (MIP) for decomposing and convexifying constraints to obtain potentially strong dual bounds.…