Optimization Letters

A compact variant of the QCR method for quadratically constrained quadratic 0–1 programs

Laura Galli, Adam N. Letchford

Published Jul 24, 2013• 16 citations

Related papers

Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method

Alain Billionnet, Sourour Elloumi, Marie-Christine Plateau

Extending the QCR method to general mixed-integer programs

BillionnetAlain, ElloumiSourour, LambertAmélie

Faster, but weaker, relaxations for quadratically constrained quadratic programs

Samuel Burer, Sunyoung Kim, Masakazu Kojima

Structured linear reformulation of binary quadratically constrained quadratic programs

Shan Jiang, Shu‐Cherng Fang, Tiantian Nie +1 more

An efficient compact quadratic convex reformulation for general integer quadratic programs

Alain Billionnet, Sourour Elloumi, Amélie Lambert

Constraint Programming for Strictly Convex Integer Quadratically-Constrained Problems

Wen-Yang Ku, J. Christopher Beck