Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

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• 24 citations
arXivHTMLPDF
DOI
10.1007/s10898-020-00972-2

Related papers

Unconstrained 0-1 polynomial optimization through convex quadratic reformulation

Amélie Lambert, Sourour Elloumi, Arnaud Lazare

•Jul 3, 2018•0 citations

Quadratic convex reformulations for quadratic 0–1 programming

Marie-Christine Plateau

4OR•May 29, 2007•4 citations

Quadratic Convex Reformulations for Integer and Mixed-Integer Quadratic Programs

Baiyi Wu, Rujun Jiang

International series in management science/operations research/International series in operations research & management science•Jan 1, 2017•0 citations

An efficient compact quadratic convex reformulation for general integer quadratic programs

Alain Billionnet, Sourour Elloumi, Amélie Lambert

Computational Optimization and Applications•Mar 23, 2012•18 citations

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

Eranda Çela, Bettina Klinz, Christophe Meyer

Journal of Combinatorial Optimization•Aug 14, 2006•15 citations

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

Discrete Applied Mathematics•Mar 6, 2008•121 citations