Elisabeth Rodríguez-Heck
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Elisabeth Rodríguez-Heck has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Yves Crama
HEC-Management School of the University of Liege, Liege, Belgium
5 shared publications - Amélie Lambert
CEDRIC-CNAM, Paris Cedex 03, France
2 shared publications Christoph Buchheim
1 shared publicationEndre Boros
Rutgers University
1 shared publication- Jens Vinther Clausen
Department of Technology, Management, and Economics, Technical University of Denmark, Kongens Lyngby DK-2800, Denmark
1 shared publication - Karl Stickler
RWTH Aachen University, Aachen, Germany
1 shared publication
Latest Publications
- 5 October 2025
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 50 (3) , 1-47
Quadratization and convexification in polynomial binary optimization
- 5 October 2025
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 50 (3) , 1-47
Quadratization and convexification in polynomial binary optimization
- Open Access
- 22 February 2024
- Published by Elsevier in Computers & Operations Research
- Vol. 165
Solving unconstrained binary polynomial programs with limited reach: Application to low autocorrelation binary sequences
- 22 February 2024
- Published by Elsevier in Computers & Operations Research
- Vol. 165
Open AccessSolving unconstrained binary polynomial programs with limited reach: Application to low autocorrelation binary sequences
- Open Access
Quadratization and convexification in polynomial binary optimization
In this paper, we discuss several reformulations and solution approaches for the problem of minimizing a polynomial in binary variables (P). We review and integrate different literature streams to describe a methodology consisting of three distinct phases, together with several possible variants for each phase. The first phase determines a recursive decomposition of each monomial of interest into pairs of submonomials, down to the initial variables. The decomposition gives rise to a so-called quadratization scheme. The second phase builds a quadratic reformulation of (P) from a given quadratization scheme, by associating a new auxiliary variable with each submonomial that appears in the scheme. A quadratic reformulation of (P) is obtained by enforcing relations between the auxiliary variables and the monomials that they represent, either through linear constraints or through penalty terms in the objective function. The resulting quadratic problem (QP) is non-convex in general and is still difficult to solve. At this stage we introduce the third phase of the resolution process, which consists in convexifying (QP). We consider different types of convexification methods, including complete linearization or quadratic convex reformulations. Theoretical properties of the different phases are recalled from the literature or are further clarified. Finally, we present some experimental results to illustrate the discussion.
Open AccessQuadratization and convexification in polynomial binary optimization
In this paper, we discuss several reformulations and solution approaches for the problem of minimizing a polynomial in binary variables (P). We review and integrate different literature streams to describe a methodology consisting of three distinct phases, together with several possible variants for each phase. The first phase determines a recursive decomposition of each monomial of interest into pairs of submonomials, down to the initial variables. The decomposition gives rise to a so-called quadratization scheme. The second phase builds a quadratic reformulation of (P) from a given quadratization scheme, by associating a new auxiliary variable with each submonomial that appears in the scheme. A quadratic reformulation of (P) is obtained by enforcing relations between the auxiliary variables and the monomials that they represent, either through linear constraints or through penalty terms in the objective function. The resulting quadratic problem (QP) is non-convex in general and is still difficult to solve. At this stage we introduce the third phase of the resolution process, which consists in convexifying (QP). We consider different types of convexification methods, including complete linearization or quadratic convex reformulations. Theoretical properties of the different phases are recalled from the literature or are further clarified. Finally, we present some experimental results to illustrate the discussion.
- 11 January 2021
- Published by Springer Nature in Mathematical Programming
- Vol. 192 (1-2) , 387-407
Persistency of linear programming relaxations for the stable set problem
- 11 January 2021
- Published by Springer Nature in Mathematical Programming
- Vol. 192 (1-2) , 387-407
Persistency of linear programming relaxations for the stable set problem
- 13 December 2019
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 39 (3) , 687-707
Compact quadratizations for pseudo-Boolean functions
- 13 December 2019
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 39 (3) , 687-707
Compact quadratizations for pseudo-Boolean functions
- 1 February 2019
- Published by Elsevier in European Journal of Operational Research
- Vol. 273 (1) , 102-107
Berge-acyclic multilinear 0–1 optimization problems
- 1 February 2019
- Published by Elsevier in European Journal of Operational Research
- Vol. 273 (1) , 102-107
Berge-acyclic multilinear 0–1 optimization problems
- 16 November 2018
- Published by Springer Nature in 4OR
- Vol. 17 (2) , 221-222
Linear and quadratic reformulations of nonlinear optimization problems in binary variables
- 16 November 2018
- Published by Springer Nature in 4OR
- Vol. 17 (2) , 221-222
Linear and quadratic reformulations of nonlinear optimization problems in binary variables
- 1 August 2017
- Published by Elsevier in Discrete Optimization
- Vol. 25, 28-47
A class of valid inequalities for multilinear 0–1 optimization problems
- 1 August 2017
- Published by Elsevier in Discrete Optimization
- Vol. 25, 28-47
A class of valid inequalities for multilinear 0–1 optimization problems