Integer programming approach to static monopolies in graphs (Q1752610)
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: Integer programming approach to static monopolies in graphs |
scientific article; zbMATH DE number 6872595
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Integer programming approach to static monopolies in graphs |
scientific article; zbMATH DE number 6872595 |
Statements
Integer programming approach to static monopolies in graphs (English)
0 references
24 May 2018
0 references
static monopoly
0 references
integer programming
0 references
polytopes
0 references
valid inequalities
0 references
cactus graphs
0 references
majority thresholds
0 references
0 references
0 references
0 references
0.8726658
0 references
0.8701656
0 references
0.8673299
0 references
0.86527324
0 references
0.8634106
0 references
0.85813916
0 references
0.8554043
0 references
0.85468614
0 references
