An Optimal Strategy for the Constrained Cycle Cover Problem

Authors:
Gilles Pesant;Patrick Soriano
Affiliations:
Département de génie informatique, École Polytechnique de Montréal, CP 6079, succ. Centre-ville, Montréal, PQ, Canada, H3C 3A7, Centre for Research on Transportation, Univ ...;Service des méthodes quantitatives de gestion, École des Hautes Études Commerciales, 3000 chemin de la Côte-Sainte-Catherine, Montréal, PQ, Canada, H3T 2A7, Centre for Res ...
Venue:
Annals of Mathematics and Artificial Intelligence
Year:
2002

Citing 6
Cited 2

Solving the maximum clique problem using a tabu search approach

Annals of Operations Research - Special issue on Tabu search
A filtering algorithm for constraints of difference in CSPs

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Clustering for the design of SONET rings in interoffice telecommunications

Management Science
Covering a graph with cycles

Computers and Operations Research
Transmission Networking: Sonet and the Synchronous Digital Hierarchy

Transmission Networking: Sonet and the Synchronous Digital Hierarchy
Data Structures and Algorithms

Data Structures and Algorithms

Global Constraints as Graph Properties on a Structured Network of Elementary Constraints of the Same Type

CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Constrained cycle covers in Halin graphs

ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

A common telecommunications network design strategy, in order to protect it against failures, is to achieve a decomposition into a set of rings covering the network. We propose a hybrid algorithm for the corresponding Constrained Cycle Cover Problem which draws from constraint programming and graph algorithms. Optimal solutions are obtained efficiently on networks of realistic size.