| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652300 | Electronic Notes in Discrete Mathematics | 2012 | 8 Pages |
Abstract
This paper presents two extensions for DGVNS (Decomposition Guided VNS) method, that exploit both the graph of clusters and separators between these clusters, to efficiently guide the exploration of large neighborhoods in VNS. Experiments performed on challenging instances of the tagSNP selection problem show the appropriateness and the efficiency of our approach.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
