On the strength of recursive McCormick relaxations for binary polynomial optimization (Q6161903): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4319989288 / rank | |||
Normal rank | |||
Revision as of 10:16, 30 July 2024
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
