| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651806 | Electronic Notes in Discrete Mathematics | 2013 | 8 Pages |
Abstract
Three formulations for the Minimum 2-Connected Dominating Set Problem, valid inequalities, a primal heuristic and Branch-and-Cut algorithms are introduced in this paper. As shown here, the preliminary computational results so far obtained indicate that these algorithms are quite promising.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
