The Cycle Embedding Problem

Ralf Borndörfer (), Marika Karbstein (), Julika Mehrgardt (), Markus Reuther () and Thomas Schlechte ()
Additional contact information
Ralf Borndörfer: Zuse Institute Berlin
Marika Karbstein: Zuse Institute Berlin
Julika Mehrgardt: Zuse Institute Berlin
Markus Reuther: Zuse Institute Berlin
Thomas Schlechte: Zuse Institute Berlin

A chapter in Operations Research Proceedings 2014, 2016, pp 465-471 from Springer

Abstract: Abstract Given two hypergraphs, representingBorndörfer, Ralf a fineKarbstein, Marika and a coarseMehrgardt, Julika “layer”, and a cycleReuther, Markus coverSchlechte, Thomas 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 programming formulation for the CEP that provides a complete description 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.

Keywords: Hyperarc; Coarse Cycle; General Hypergraphs; Final Layer; Cycle Software (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-28697-6_65

Ordering information: This item can be ordered from
http://www.springer.com/9783319286976

DOI: 10.1007/978-3-319-28697-6_65

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().