On the hardest problem formulations for the 0/1 Lasserre hierarchy (Q2976145)
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 6705637
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the hardest problem formulations for the 0/1 Lasserre hierarchy |
scientific article; zbMATH DE number 6705637 |
Statements
On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy (English)
0 references
13 April 2017
0 references
discrete optimization
0 references
mathematical programming
0 references
Lasserre/SoS hierarchy
0 references
0 references
0 references
0.9959863424301147
0 references
0.8260810971260071
0 references
0.8207040429115295
0 references
0.8154122233390808
0 references
