The Cycle Embedding Problem

  • 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.

Export metadata

  • Export Bibtex

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Ralf Borndörfer, Marika Karbstein, Julika Mehrgahrdt, Markus Reuther, Thomas Schlechte
Document Type:In Proceedings
Parent Title (English):Operations Research Proceedings 2014
First Page:465
Last Page:472
Year of first publication:2016
Preprint:urn:nbn:de:0297-zib-52788
DOI:http://dx.doi.org/10.1007/978-3-319-28697-6_65

$Rev: 13581 $