Covering a graph with cycles

Covering a graph with cycles

0.00 Avg rating0 Votes
Article ID: iaor19991951
Country: United Kingdom
Volume: 25
Issue: 6
Start Page Number: 499
End Page Number: 504
Publication Date: Jun 1998
Journal: Computers and Operations Research
Authors: , ,
Keywords: heuristics
Abstract:

This article describes a lower bounding procedure and heuristics for the Cycle Cover Problem which consists of determining a least cost cover of an undirected graph with simple cycles. Applications of this problem arise in network design and in telecommunications. Computational results demonstrate the quality of the proposed heuristics. On 100 vertex graphs, the best of these consistently produces optimal or quasi-optimal solutions.

Reviews

Required fields are marked *. Your email address will not be published.