arXiv:1901.07904 · Journal of Global Optimization

Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation

Sourour Elloumi, Amélie Lambert, Arnaud Lazare

Published Jan 4, 2021• 22 citations

Related papers

Unconstrained 0-1 polynomial optimization through convex quadratic reformulation

Amélie Lambert, Sourour Elloumi, Arnaud Lazare

Quadratic convex reformulations for quadratic 0–1 programming

Marie-Christine Plateau

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

Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem

Eranda Çela, Bettina Klinz, Christophe Meyer

A simple polynomial-time algorithm for convex quadratic programming

Paul Tseng, Decision Systems.