default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKarl Nachtigall
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j6]Nadine Friesen, Tim Sander
, Christina Büsing, Karl Nachtigall, Nils Nießen:
The complexity of the timetable-based railway network design problem. Networks 83(2): 289-299 (2024)- 2015
- [j5]Michael Kümmling, Peter Großmann, Karl Nachtigall, Jens Opitz, Reyk Weiß:
A state-of-the-art realization of cyclic railway timetable computation. Public Transp. 7(3): 281-293 (2015) - 1997
- [j4]Karl Nachtigall:
Powers of matrices over an extremal algebra with applications to periodic graphs. Math. Methods Oper. Res. 46(1): 87-102 (1997) - 1996
- [j3]Karl Nachtigall, Stefan Voget:
A genetic algorithm approach to periodic railway synchronization. Comput. Oper. Res. 23(5): 453-463 (1996) - [j2]Karl Nachtigall:
Periodic Network Optimization with Different Arc Frequencies. Discret. Appl. Math. 69(1-2): 1-17 (1996) - [j1]Karl Nachtigall:
Simultaneous semi-eigenvectors for matrices over an extremal algebra. Math. Methods Oper. Res. 43(1): 107-119 (1996)
Conference and Workshop Papers
- 2022
- [c13]Tim Sander, Nadine Friesen, Karl Nachtigall, Nils Nießen:
Modeling Uncertainty in the Timetable-Based Railway Network Design Problem. OR 2022: 503-509 - 2019
- [c12]Stefan Frank, Karl Nachtigall:
Capacity Planning for Airport Runway Systems. OR 2019: 797-803 - 2017
- [c11]Stefan Reitmann, Karl Nachtigall:
Applying Bidirectional Long Short-Term Memories (BLSTM) to Performance Data in Air Traffic Management for System Identification. ICANN (2) 2017: 528-536 - 2016
- [c10]Philine Gattermann, Peter Großmann, Karl Nachtigall, Anita Schöbel:
Integrating Passengers' Routes in Periodic Timetabling: A SAT approach. ATMOS 2016: 3:1-3:15 - 2015
- [c9]Karl Nachtigall:
Modelling and Solving a Train Path Assignment Model with Traffic Day Restriction. OR 2015: 621-627 - 2014
- [c8]Karl Nachtigall, Jens Opitz:
Modelling and Solving a Train Path Assignment Model. OR 2014: 423-428 - 2013
- [c7]Stefan Frank, Henning Preis, Karl Nachtigall:
On the Modeling of Recharging Stops in Context of Vehicle Routing Problems. OR 2013: 129-135 - 2012
- [c6]Peter Großmann, Steffen Hölldobler, Norbert Manthey, Karl Nachtigall, Jens Opitz, Peter Steinke:
Solving Periodic Event Scheduling Problems with SAT. IEA/AIE 2012: 166-175 - [c5]Reyk Weiß, Jens Opitz, Karl Nachtigall:
A Novel Approach to Strategic Planning of Rail Freight Transport. OR 2012: 463-468 - [c4]Henning Preis, Stefan Frank, Karl Nachtigall:
Energy-Optimized Routing of Electric Vehicles in Urban Delivery Systems. OR 2012: 583-588 - 2008
- [c3]Karl Nachtigall, Karl Jerosch:
Simultaneous Network Line Planning and Traffic Assignment. ATMOS 2008 - [c2]Karl Nachtigall, Jens Opitz:
Solving Periodic Timetable Optimisation Problems by Modulo Simplex Calculations. ATMOS 2008 - 2007
- [c1]Karl Nachtigall, Jens Opitz:
A Modulo Network Simplex Method for Solving Periodic Timetable Optimisation Problems. OR 2007: 461-466
Informal and Other Publications
- 2023
- [i1]Nadine Friesen, Tim Sander, Karl Nachtigall, Nils Nießen:
The complexity of the Timetable-Based Railway Network Design Problem. CoRR abs/2308.00420 (2023)
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-09-13 01:36 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:
