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 the normal view instead:
scientific article; zbMATH DE number 7703348
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8875731
0 references
0.8774771
0 references
0.87658787
0 references
0.8708265
0 references
0.8692173
0 references
0.8687076
0 references
0.8677439
0 references
0.8675728
0 references
