75 citations · 261 across the 31 of their papers we have counts for
3 papers · 2 filters
An Abstract Model for Branch and Cut
Aleksandr M. Kazachkov, Pierre Le Bodic, Sriram Sankaranarayanan
Branch and cut is the dominant paradigm for solving a wide range of mathematical programming problems -- linear or nonlinear -- combining efficient search (via branch and bound) an…
The Cut-and-Play Algorithm: Computing Nash Equilibria via Outer Approximations
Margarida Carvalho, Gabriele Dragotto, Andrea Lodi +1
We introduce Cut-and-Play, a practically-efficient algorithm for computing Nash equilibria in simultaneous non-cooperative games where players decide via nonconvex and possibly unb…
Fairness over time in dynamic resource allocation with an application in Healthcare
Andrea Lodi, Philippe Olivier, Gilles Pesant +1
Decision making problems are typically concerned with maximizing efficiency. In contrast, we address problems where there are multiple stakeholders and a centralized decision maker…