8 citations · 10 across the 7 of their papers we have counts for
7 papers
Relaxations and Cutting Planes for Linear Programs with Complementarity Constraints
Alberto Del Pia, Jeff Linderoth, Haoran Zhu
We study relaxations for linear programs with complementarity constraints, especially instances whose complementary pairs of variables are not independent. Our formulation is based…
Clustering with Queries under Semi-Random Noise
Alberto Del Pia, Mingchen Ma, Christos Tzamos
The seminal paper by Mazumdar and Saha \cite{MS17a} introduced an extensive line of work on clustering with noisy queries. Yet, despite significant progress on the problem, the pro…
Aggregation-based cutting-planes for packing and covering integer programs
Merve Bodur, Alberto Del Pia, Santanu S. Dey +2
In this paper, we study the strength of Chvatal-Gomory (CG) cuts and more generally aggregation cuts for packing and covering integer programs (IPs). Aggregation cuts are obtained…
Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane
Alberto Del Pia, Robert Hildebrand, Robert Weismantel +1
We complete the complexity classification by degree of minimizing a polynomial over the integer points in a polyhedron in . Previous work shows that optimizing a quad…
Mixed-integer Quadratic Programming is in NP
Alberto Del Pia, Santanu S. Dey, Marco Molinaro
Mixed-integer quadratic programming is the problem of optimizing a quadratic function over points in a polyhedral set where some of the components are restricted to be integral. In…
Reverse Split Rank
Michele Conforti, Alberto Del Pia, Marco Di Summa +1
The reverse split rank of an integral polyhedron P is defined as the supremum of the split ranks of all rational polyhedra whose integer hull is P. Already in R^3 there exist polyh…