The minimum weakly connected independent set problem: polyhedral results and branch-and-cut (Q1751176)
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 6872098
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum weakly connected independent set problem: polyhedral results and branch-and-cut |
scientific article; zbMATH DE number 6872098 |
Statements
The minimum weakly connected independent set problem: polyhedral results and branch-and-cut (English)
0 references
24 May 2018
0 references
weakly connected independent set
0 references
polytopes
0 references
valid inequalities
0 references
graph operations
0 references
branch-and-cut
0 references
0 references
0 references
0 references
0 references
0.9023442
0 references
0.87718755
0 references
0.8760703
0 references
0.87580633
0 references
0.8747649
0 references
0.8728503
0 references
0.8712455
0 references
0 references
