Stefano Gualandi — accepted AI-conference papers

2026

Batched First-Order Methods for Parallel LP Solving in MIP

Nicolas Blin, Stefano Gualandi, Christopher Maes, Andrea Lodi, Bartolomeo Stellato

ICML 2026poster

We present a batched first-order method for solving multiple linear programs in parallel on GPUs. Our approach extends the primal-dual hybrid gradient algorithm to efficiently solve batches of related linear programming problems that arise in mixed-integer programming techniques such as strong branc…

Cited by 0 Source ↗Scholar ↗

2018

Computing Kantorovich-Wasserstein Distances on $d$-dimensional histograms using $(d+1)$-partite graphs

Gennaro Auricchio, Federico Bassetti, Stefano Gualandi, Marco Veneroni

NeurIPS 2018poster

This paper presents a novel method to compute the exact Kantorovich-Wasserstein distance between a pair of $d$-dimensional histograms having $n$ bins each. We prove that this problem is equivalent to an uncapacitated minimum cost flow problem on a $(d+1)$-partite graph with $(d+1)n$ nodes and $dn^{\…

Cited by 31 Source ↗PDF ↗Scholar ↗