Covering a graph with cycles.

DOI10.1016/S0305-0548(97)00082-8zbMath1040.90555MaRDI QIDQ1406651

Patrick Soriano, Gilbert Laporte, Martine Labbé

Publication date: 7 September 2003

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

Graph theoryComputational methodsProblem solvingCycle cover problems (CCP)Heuristic methods

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Approximation methods and heuristics in mathematical programming (90C59) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Shipper collaboration, The bi-objective insular traveling salesman problem with maritime and ground transportation costs, A tabu search algorithm for self-healing ring network design.

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Shortest coverings of graphs with cycles
• Cycle covering in bridgeless graphs
• Eulerian graphs and related topics. Part 1, Volume 2
• Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4
• Covering Multigraphs by Simple Circuits
• Covering Graphs by Simple Circuits
• Covering Graphs by Cycles
• Matching, Euler tours and the Chinese postman
• Clustering for the Design of SONET Rings in Interoffice Telecommunications