An optimal strategy for the Constrained Cycle Cover Problem

DOI10.1023/A:1014444525059MaRDI QIDQ1601929zbMATH OpenOpenAlexFDO

Authors Gilles Pesant, Patrick Soriano

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

constraint programmingtelecommunicationsnetwork protectionself-healing rings

Mathematics Subject Classification ID

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

Recommendations

• An optimal strategy for the constrained cycle cover problem
• The bounded cycle-cover problem
• Constrained Cycle Covers in Halin Graphs
• Covering a graph with cycles.
• Optimization based algorithms for finding minimal cost ring covers in survivable networks

Cited in

(5)

• Constrained Cycle Covers in Halin Graphs
• An optimal strategy for the constrained cycle cover problem
• Covering a graph with cycles.
• A tabu search algorithm for self-healing ring network design.
• The bounded cycle-cover problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1601929)