default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarkus Reuther
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j6]Thomas Schlechte
, Ralf Borndörfer, Jonas Denißen, Simon Heller, Torsten Klug, Michael Küpper, Niels Lindner, Markus Reuther, Andreas Söhlke, William Steadman:
Timetable optimization for a moving block system. J. Rail Transp. Plan. Manag. 22: 100315 (2022)- 2021
- [j5]Ralf Borndörfer, Thomas Eßer, Patrick Frankenberger, Andreas Huck, Christoph Jobmann, Boris Krostitz, Karsten Kuchenbecker, Kai Mohrhagen, Philipp Nagl, Michael Peterson, Markus Reuther, Thilo Schang, Michael Schoch, Hanno Schülldorf, Peter Schütz, Tobias Therolf, Kerstin Waas, Steffen Weider:
Deutsche Bahn Schedules Train Rotations Using Hypergraph Optimization. INFORMS J. Appl. Anal. 51(1): 42-62 (2021) - 2019
- [j4]Ralf Borndörfer, Boris Grimm, Markus Reuther, Thomas Schlechte:
Optimization of handouts for rolling stock rotations. J. Rail Transp. Plan. Manag. 10: 1-8 (2019) - 2017
- [j3]Ralf Borndörfer, Boris Grimm, Markus Reuther, Thomas Schlechte:
Template-based re-optimization of rolling stock rotations. Public Transp. 9(1-2): 365-383 (2017) - 2016
- [j2]Ralf Borndörfer, Markus Reuther, Thomas Schlechte, Kerstin Waas, Steffen Weider:
Integrated Optimization of Rolling Stock Rotations for Intercity Railways. Transp. Sci. 50(3): 863-877 (2016) - 2013
- [j1]Ralf Borndörfer, Andreas Löbel, Markus Reuther, Thomas Schlechte, Steffen Weider:
Rapid branching. Public Transp. 5(1-2): 3-23 (2013)
Conference and Workshop Papers
- 2022
- [c9]Torsten Klug, Markus Reuther, Thomas Schlechte:
Does Laziness Pay Off? - A Lazy-Constraint Approach to Timetabling. ATMOS 2022: 11:1-11:8 - 2019
- [c8]Boris Grimm, Ralf Borndörfer, Markus Reuther, Thomas Schlechte:
A Cut Separation Approach for the Rolling Stock Rotation Problem with Vehicle Maintenance. ATMOS 2019: 1:1-1:12 - 2017
- [c7]Ralf Borndörfer, Matthias Breuer, Boris Grimm, Markus Reuther, Stanley Schade, Thomas Schlechte:
Timetable Sparsification by Rolling Stock Rotation Optimization. OR 2017: 723-728 - 2015
- [c6]Ralf Borndörfer, Markus Reuther:
Regional Search for the Resource Constrained Assignment Problem. ATMOS 2015: 111-129 - 2014
- [c5]Markus Reuther:
Local Search for the Resource Constrained Assignment Problem. ATMOS 2014: 62-78 - [c4]Ralf Borndörfer, Markus Reuther, Thomas Schlechte:
A Coarse-To-Fine Approach to the Railway Rolling Stock Rotation Problem. ATMOS 2014: 79-91 - [c3]Ralf Borndörfer, Marika Karbstein, Julika Mehrgardt, Markus Reuther, Thomas Schlechte:
The Cycle Embedding Problem. OR 2014: 465-471 - 2013
- [c2]Ralf Borndörfer, Julika Mehrgardt, Markus Reuther, Thomas Schlechte, Kerstin Waas:
Re-Optimization of Rolling Stock Rotations. OR 2013: 49-55 - 2011
- [c1]Ralf Borndörfer, Markus Reuther, Thomas Schlechte, Steffen Weider:
A Hypergraph Model for Railway Vehicle Rotation Planning. ATMOS 2011: 146-155
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
