| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651807 | Electronic Notes in Discrete Mathematics | 2013 | 8 Pages |
Abstract
This paper introduces a formulation for the Minimum Dominating Cycle Problem. Additionally, a Branch and Cut algorithm, based on that formulation, is also investigated. So far, the algorithm contains no primal heuristics. However, it managed to solve to proven optimality, in acceptable CPU times, all test instances with up to 120 vertices.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
