Name
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.endm.2013.05.121 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
Minimum Dominating Cycle Problem,Formulations,Valid Inequalities,Branch and Cut Algorithm | Discrete mathematics,Mathematical optimization,Combinatorics,Vertex (geometry),Branch and cut,Heuristics,Mathematics | Journal |
Volume | ISSN | Citations |
41 | 1571-0653 | 0 |
PageRank | References | Authors |
0.34 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Abilio Lucena | 1 | 362 | 34.05 |
| Alexandre Salles da Cunha | 2 | 242 | 22.32 |
| Luidi Simonetti | 3 | 152 | 15.82 |