Efficient linear reformulations for binary polynomial optimization problems

DOI10.1016/j.cor.2023.106240OpenAlexW4362719262MaRDI QIDQ6164618

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

polynomial optimizationMINLPlinear reformulation

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

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

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