Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem (Q2940057)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem |
scientific article |
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
