1 citations · 2 across the 2 of their papers we have counts for
3 papers
cs.DM2020★ 1 cited
MIP and Set Covering approaches for Sparse Approximation
Diego Delle Donne, Matthieu Kowalski, Leo Liberti
The Sparse Approximation problem asks to find a solution such that , for a given norm , minimizing the size of the support $||x||_0 := \#\{j \ |\ x_j…
cs.DS2019★ 1 cited
Star Routing: Between Vehicle Routing and Vertex Cover
Diego Delle Donne, Guido Tagliavini
We consider an optimization problem posed by an actual newspaper company, which consists of computing a minimum length route for a delivery truck, such that the driver only stops a…
cs.DM2017
On the combinatorics of the 2-class classification problem
Ricardo C. Corrêa, Diego Delle Donne, Javier Marenco
A set of points is linearly separable if the convex hulls of and are disjoint, hence there exists a hyperplane separating $X_B…