The cycle embedding problem

DOI10.1007/978-3-319-28697-6_65zbMATH Open1345.90089OpenAlexW2242422621MaRDI QIDQ2806986FDOQ2806986

Markus Reuther, Julika Mehrgardt, Thomas Schlechte, Marika Karbstein, Ralf Borndörfer

Publication date: 19 May 2016

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-28697-6_65

Recommendations

• A hypergraph model for railway vehicle rotation planning
• The hypergraph assignment problem
• Minimum cost hyperassignments with applications to ICE/IC rotation planning
• Automata, Languages and Programming
• Finding short integral cycle bases for cyclic timetabling

zbMATH Keywords

NP-hardinteger programming formulaionrailway vehicle rotation scheduling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Cited In (3)

• The Euclidean distance completion problem: cycle completability
• Cyclicity versus center problem
• The Maximum Flow Problem for Oriented Flows

This page was built for publication: The cycle embedding problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806986)