On the strength of recursive McCormick relaxations for binary polynomial optimization (Q6161903)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the strength of recursive McCormick relaxations for binary polynomial optimization |
scientific article; zbMATH DE number 7703348
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the strength of recursive McCormick relaxations for binary polynomial optimization |
scientific article; zbMATH DE number 7703348 |
Statements
On the strength of recursive McCormick relaxations for binary polynomial optimization (English)
0 references
28 June 2023
0 references
binary polynomial optimization
0 references
recursive McCormick relaxations
0 references
multilinear polytope
0 references
extended flower relaxation
0 references
cutting planes
0 references
0 references
0 references
0 references
0 references
0 references
