Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation

Sourour Elloumi, Amélie Lambert and Arnaud Lazare

january, 2021

Type de publication :

Article (revues avec comité de lecture)

Journal :

Journal of Global Optimization, vol. 80 (2), pp. 231-248

Editeur :

Springer Verlag

DOI :

10.1007/s10898-020-00972-2

HAL :

hal-01872996

arXiv :

1901.07904

Mots clés :

Unconstrained binary polynomial programming; Quadratic convex reformulation; Experiments; Global optimization; Semidefinite programming; Semi-definite programming;

BibTeX :

@article{Ell-Lam-Laz-2021,
    author={Sourour Elloumi and Amélie Lambert and Arnaud Lazare },
    title={Solving unconstrained 0-1 polynomial programs through 
           quadratic convex reformulation },
    doi={10.1007/s10898-020-00972-2 },
    journal={Journal of Global Optimization },
    year={2021 },
    month={1},
    volume={80 (2) },
    pages={231--248},
}