Title of article
Formulating and Solving the Minimum Dominating Cycle Problem
Author/Authors
Lucena، نويسنده , , Abilio and Salles da Cunha، نويسنده , , Alexandre and Simonetti، نويسنده , , Luidi، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2013
Pages
8
From page
423
To page
430
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.
Keywords
Formulations , Valid Inequalities , Minimum Dominating Cycle Problem , Branch and Cut Algorithm
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2013
Journal title
Electronic Notes in Discrete Mathematics
Record number
1456247
Link To Document