On the strength of recursive McCormick relaxations for binary polynomial optimization
From MaRDI portal
Publication:6161903
DOI10.1016/j.orl.2023.01.009zbMath1525.90325arXiv2209.13034OpenAlexW4319989288MaRDI QIDQ6161903
Publication date: 28 June 2023
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2209.13034
cutting planesbinary polynomial optimizationmultilinear polytopeextended flower relaxationrecursive McCormick relaxations
Cites Work
- Concave extensions for nonlinear 0-1 maximization problems
- Pseudo-Boolean optimization
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- Semidefinite programming relaxations for semialgebraic problems
- A hybrid LP/NLP paradigm for global optimization relaxations
- On decomposability of multilinear sets
- A class of valid inequalities for multilinear 0-1 optimization problems
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Some results on the strength of relaxations of multilinear functions
- Explicit convex and concave envelopes through polyhedral subdivisions
- On the impact of running intersection inequalities for globally solving polynomial optimization problems
- Cardinality constrained multilinear sets
- Global optimization of nonconvex problems with multilinear intermediates
- Degrees of acyclicity for hypergraphs and relational database schemes
- Jointly Constrained Biconvex Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- The Multilinear Polytope for Acyclic Hypergraphs
- The Running Intersection Relaxation of the Multilinear Polytope
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- A Polyhedral Study of Binary Polynomial Programs
- Analysis of bounds for multilinear functions
This page was built for publication: On the strength of recursive McCormick relaxations for binary polynomial optimization
