Showing math.OCShow all
3 papers · 1 filter
math.OC2026
Relaxations for binary polynomial optimization via signed certificates
Liding Xu, Leo Liberti
We consider the problem of minimizing a polynomial over the (binary) hypercube. We show that, for a specific set of polynomials, their binary non-negativity (i.e. on the hyperc…
math.OC2024
Cutting planes for signomial programming
Liding Xu, Claudia D'Ambrosio, Leo Liberti +1
Cutting planes are of crucial importance when solving nonconvex nonlinear programs to global optimality, for example using the spatial branch-and-bound algorithms. In this paper, w…
math.OC2024
Formulations of the continuous set-covering problem on networks: a comparative study
Liding Xu, Claudia D'Ambrosio
We study the continuous set covering problem on networks and propose several new MILP formulations and valid inequalities. In contrast to state-of-the-art formulations, the new for…