20 citations · 46 across the 11 of their papers we have counts for
14 papers
On the integrality Gap of Small Asymmetric Traveling Salesman Problems: A Polyhedral and Computational Approach
Eleonora Vercesi, Janos Barta, Luca Maria Gambardella +2
In this paper, we investigate the integrality gap of the Asymmetric Traveling Salesman Problem (ATSP) with respect to the linear relaxation given by the Asymmetric Subtour Eliminat…
Lower bounds for the integrality gap of the bi-directed cut formulation of the Steiner Tree Problem
Ambrogio Maria Bernardelli, Eleonora Vercesi, Stefano Gualandi +2
In this work, we study the metric Steiner Tree problem on graphs focusing on computing lower bounds for the integrality gap of the bi-directed cut (BCR) formulation and introducing…
Multi-Objective Linear Ensembles for Robust and Sparse Training of Few-Bit Neural Networks
Ambrogio Maria Bernardelli, Stefano Gualandi, Hoong Chuin Lau +2
Training neural networks (NNs) using combinatorial optimization solvers has gained attention in recent years. In low-data settings, state-of-the-art mixed integer linear programmin…
A kinetic description of the body size distributions of species
Stefano Gualandi, Giuseppe Toscani, Eleonora Vercesi
In this paper, by resorting to classical methods of statistical mechanics, we build a kinetic model able to reproduce the observed statistical weight distribution of many diverse s…
A SAT Encoding to Compute Aperiodic Tiling Rhythmic Canons
Gennaro Auricchio, Luca Ferrarini, Stefano Gualandi +2
In Mathematical Music theory, the Aperiodic Tiling Complements Problem consists in finding all the possible aperiodic complements of a given rhythm . The complexity of this prob…
On the generation of Metric TSP instances with a large integrality gap by branch-and-cut
Eleonora Vercesi, Stefano Gualandi, Monaldo Mastrolilli +1
This paper introduces a computational method for generating metric Travelling Salesman Problem (TSP) instances having a large integrality gap. The method is based on the solution o…
Total Coloring and Total Matching: Polyhedra and Facets
Luca Ferrarini, Stefano Gualandi
A total coloring of a graph is an assignment of colors to vertices and edges such that neither two adjacent vertices nor two incident edges get the same color, and, fo…
The Gene Mover's Distance: Single-cell similarity via Optimal Transport
Riccardo Bellazzi, Andrea Codegoni, Stefano Gualandi +2
This paper introduces the Gene Mover's Distance, a measure of similarity between a pair of cells based on their gene expression profiles obtained via single-cell RNA sequencing. Th…
The Equivalence of Fourier-based and Wasserstein Metrics on Imaging Problems
Gennaro Auricchio, Andrea Codegoni, Stefano Gualandi +2
We investigate properties of some extensions of a class of Fourier-based probability metrics, originally introduced to study convergence to equilibrium for the solution to the spat…
Human Behavior And Lognormal Distribution. A Kinetic Description
Stefano Gualandi, Giuseppe Toscani
In recent years it has been increasing evidence that lognormal distributions are widespread in physical and biological sciences, as well as in various phenomena of economics and so…
The size distribution of cities: a kinetic explanation
Stefano Gualandi, Giuseppe Toscani
We present a kinetic approach to the formation of urban agglomerations which is based on simple rules of immigration and emigration. In most cases, the Boltzmann-type kinetic descr…
Computing Kantorovich-Wasserstein Distances on -dimensional histograms using -partite graphs
Gennaro Auricchio, Federico Bassetti, Stefano Gualandi +1
This paper presents a novel method to compute the exact Kantorovich-Wasserstein distance between a pair of -dimensional histograms having bins each. We prove that this probl…
On the Computation of Kantorovich-Wasserstein Distances between 2D-Histograms by Uncapacitated Minimum Cost Flows
Federico Bassetti, Stefano Gualandi, Marco Veneroni
In this work, we present a method to compute the Kantorovich-Wasserstein distance of order one between a pair of two-dimensional histograms. Recent works in Computer Vision and Mac…
Call center service times are lognormal. A Fokker--Planck description
Stefano Gualandi, Giuseppe Toscani
Call centers are service networks in which agents provide telephone-based services. An important part of call center operations is represented by service durations. In recent stati…