2 papers
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.CO2012
Intersection cuts from multiple rows: a disjunctive programming approach
Egon Balas, Andrea Qualizza
We address the issue of generating cutting planes for mixed integer programs from multiple rows of the simplex tableau with the tools of disjunctive programming. A cut from q rows…