16 citations · 22 across the 5 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2012
Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
Andrea Qualizza, Pietro Belotti, Francois Margot
We investigate the use of linear programming tools for solving semidefinite programming relaxations of quadratically constrained quadratic problems. Classes of valid linear inequal…
math.CO2008★ 16 cited
A local branching heuristic for MINLPs
Giacomo Nannicini, Pietro Belotti, Leo Liberti
Local branching is an improvement heuristic, developed within the context of branch-and-bound algorithms for MILPs, which has proved to be very effective in practice. For the binar…