The Cycle Embedding Problem

Please always quote using this URN: urn:nbn:de:0297-zib-52788
  • Given two hypergraphs, representing a fine and a coarse "layer", and a cycle cover of the nodes of the coarse layer, the cycle embedding problem (CEP) asks for an embedding of the coarse cycles into the fine layer. The CEP is NP-hard for general hypergraphs, but it can be solved in polynomial time for graphs. We propose an integer rogramming formulation for the CEP that provides a complete escription of the CEP polytope for the graphical case. The CEP comes up in railway vehicle rotation scheduling. We present computational results for problem instances of DB Fernverkehr AG that justify a sequential coarse-first-fine-second planning approach.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Author:Ralf BorndörferORCiD, Marika Karbstein, Julika Mehrgardt, Markus Reuther, Thomas Schlechte
Document Type:ZIB-Report
Tag:cycle embedding problem; railway vehicle rotation scheduling; sequential coarse-first-fine-second planning approach
Date of first Publication:2014/10/15
Series (Serial Number):ZIB-Report (14-37)
Published in:Appeared in: Operations Research Proceedings 2014
Licence (German):License LogoCreative Commons - Namensnennung-Nicht kommerziell