A matheuristic approach for solving the 2-connected dominating set problem
<p dir="ltr">This paper describes a matheuristic approach for solving the 2-connected dominating set problem (2-CDS). The goal of the proposed method is to find near optimal solutions for large graphs. The algorithm is based on a Greedy Randomized Adaptive Search Procedure (GRASP). I...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
2019
|
| Subjects: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|