Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem (Q2940057)
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 6390377
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem |
scientific article; zbMATH DE number 6390377 |
Statements
Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem (English)
0 references
26 January 2015
0 references
connected dominating sets
0 references
valid inequalities
0 references
Benders decomposition
0 references
branch and cut
0 references
0 references
0 references
0 references
0.8601415753364563
0 references
0.8490627408027649
0 references
0.821901261806488
0 references
0.8215601444244385
0 references
0.8064051866531372
0 references
