Volume computation for sparse Boolean quadric relaxations (Q2297660)
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 7170033
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Volume computation for sparse Boolean quadric relaxations |
scientific article; zbMATH DE number 7170033 |
Statements
Volume computation for sparse Boolean quadric relaxations (English)
0 references
20 February 2020
0 references
volume
0 references
Boolean quadric polytope
0 references
correlation polytope
0 references
mixed-integer non-linear optimization
0 references
order polytope
0 references
counting linear extensions
0 references
bounded treewidth
0 references
cut polytope
0 references
0 references
0 references
0 references
0 references
0 references
0.8865213
0 references
0.88491464
0 references
0.86100125
0 references
0.8588176
0 references
0.85828733
0 references
0.8579151
0 references
0.85611665
0 references
0.8540305
0 references
0.8522376
0 references
0.8511273
0 references
