Efficient linear reformulations for binary polynomial optimization problems

DOI10.1016/J.COR.2023.106240MaRDI QIDQ6164618zbMATH OpenOpenAlexFDO

Authors Sourour Elloumi, Zoé Verchère

Publication date 4 July 2023

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2023.106240

zbMATH Keywords

linear reformulationMINLPpolynomial optimization

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Quadratic reformulations of nonlinear binary optimization problems
• Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
• Linear Reformulations of Integer Quadratic Programs
• Linear forms of nonlinear expressions: new insights on old ideas
• Inductive linearization for binary quadratic programs with linear constraints

Cites work

• A class of valid inequalities for multilinear 0-1 optimization problems
• Compact quadratizations for pseudo-Boolean functions
• Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
• Julia: a fresh approach to numerical computing
• JuMP: a modeling language for mathematical optimization
• L’algebre de Boole et ses applications en recherche operationnelle
• Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization
• On linear programming relaxations for solving polynomial programming problems
• On the impact of running intersection inequalities for globally solving polynomial optimization problems
• Optimal quadratic reformulations of fourth degree pseudo-Boolean functions
• Pseudo-Boolean optimization
• RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems
• Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization
• Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
• The basic algorithm for pseudo-Boolean programming revisited
• The Boolean quadratic polytope: Some characteristics, facets and relatives
• The multilinear polytope for acyclic hypergraphs
• The Running Intersection Relaxation of the Multilinear Polytope
• The unconstrained binary quadratic programming problem: a survey

Cited in

(5)

• Dantzig-Wolfe reformulations for binary quadratic problems
• On the strength of recursive McCormick relaxations for binary polynomial optimization
• Degree reduction techniques for polynomial optimization problems
• Extending a continuous RLT-based algorithm to mixed-integer polynomial problems
• An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms

This page was built for publication: Efficient linear reformulations for binary polynomial optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6164618)