An optimal strategy for the Constrained Cycle Cover Problem

DOI10.1023/A:1014444525059zbMath1014.68002OpenAlexW1528496018MaRDI QIDQ1601929

Patrick Soriano, Gilles Pesant

Publication date: 27 June 2002

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1014444525059

zbMATH Keywords

telecommunicationsconstraint programmingnetwork protectionself-healing rings

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Applications of graph theory to circuits and networks (94C15)

Related Items (1)

A tabu search algorithm for self-healing ring network design.

This page was built for publication: An optimal strategy for the Constrained Cycle Cover Problem