Discrete Applied Mathematics

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

Published Mar 6, 2008• 120 citations

Related papers

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

Laura Galli, Adam N. Letchford

Quadratic convex reformulations for quadratic 0–1 programming

Marie-Christine Plateau

Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation

Sourour Elloumi, Amélie Lambert, Arnaud Lazare

Quadratic Convex Reformulations for Integer and Mixed-Integer Quadratic Programs

Baiyi Wu, Rujun Jiang

An efficient compact quadratic convex reformulation for general integer quadratic programs

Alain Billionnet, Sourour Elloumi, Amélie Lambert

Quadratic convex reformulations for a class of complex quadratic programming problems

Cheng Zhu Lu, Gaojian Kang, Guangtai Qu +1 more