Skip to main content
SpringerLink
Log in

An Optimal Strategy for the Constrained Cycle Cover Problem

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A.V. Aho, J.E. Hopcroft and J.D. Ullman, Data Structures and Algorithms (Addison-Wesley, Reading, MA, 1983).

    Google Scholar 

  2. S. Cosares, D.N. Deutsch, I. Saniee and D.J. Wasem, SONET toolkit: a decision support system for designing robust and cost-effective fiber-optic networks, Interfaces 25 (1995) 20-40.

    Google Scholar 

  3. J. Edmonds and E.L. Johnson, Matching Euler tours and the Chinese Postman Problem, Mathematical Programming 5 (1973) 88-124.

    Google Scholar 

  4. H.A. Eiselt, M. Gendreau and G. Laporte, Arc routing problems. Part I: The Chinese Postman Problem, Operations Research 43(2) (1995) 231-242.

    Google Scholar 

  5. M. Gendreau, P. Soriano and L. Salvail, Solving the Maximum Clique Problem using a tabu search approach, Annals of Operations Research 41 (1993) 385-403.

    Google Scholar 

  6. M. Gondran and M. Minoux, Graphes et algorithmes, 2nd edition (Eyrolles, Paris, France, 1985).

    Google Scholar 

  7. M. Labbé, G. Laporte and P. Soriano, Covering a graph with cycles, Computers and Operations Research 25(6) (1998) 499-504.

    Google Scholar 

  8. M. Laguna, Clustering for the design of SONET rings in interoffice telecommunications, Management Science 40 (1994) 1533-1541.

    Google Scholar 

  9. J.-C. Régin, A filtering algorithm for constraints of difference in CSPs, in: Proc. of the Twelfth National Conference on Artificial Intelligence (AAAI-94) (1994) pp. 362-367.

  10. M. Sexton and A. Reid, Transmission Networking: SONET and the Synchronous Digital Hierarchy (Artech House, Boston, MA, 1992).

    Google Scholar 

  11. J. Sosnosky and T.H. Wu, SONET ring applications for survivable fiber loop networks, IEEE Communications Magazine (June 1991) 51-58.

  12. T.H. Wu, D.J. Kolar and R.H. Cardwell, Survivable network architectures for broad-band fiber optic networks: models and performance comparison, IEEE Journal of Lightwave Technology 6 (1988) 1698-1709.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département de génie informatique, École Polytechnique de Montréal, CP 6079, succ. Centre-ville, Montréal, PQ, Canada, H3C 3A7

    Gilles Pesant

  2. Centre for Research on Transportation, Université de Montréal, CP 6128, succ. Centre-ville, Montréal, PQ, Canada, H3C 3J7

    Gilles Pesant & Patrick Soriano

  3. 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

    Patrick Soriano

Authors
  1. Gilles Pesant
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Patrick Soriano
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pesant, G., Soriano, P. An Optimal Strategy for the Constrained Cycle Cover Problem. Annals of Mathematics and Artificial Intelligence 34, 313–325 (2002). https://doi.org/10.1023/A:1014444525059

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1014444525059

Search

Navigation