default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 9 matches
- 2024
- Sowjanya Dhulipala, Gopal R. Patil:
Shippers/freight forwarders' acceptance of dedicated rail freight corridors for freight mobility in India. J. Rail Transp. Plan. Manag. 32: 100481 (2024) - Michael Luciano Chaves Franz, Néstor Fabián Ayala, Ana Margarita Larranaga Uriarte:
Industry 4.0 for passenger railway companies: A maturity model proposal for technology management. J. Rail Transp. Plan. Manag. 32: 100480 (2024) - Inneke Van Hoeck, Pieter Vansteenwegen:
A MILP model to improve the robustness of a railway timetable by retiming and rerouting in a complex bottleneck area. J. Rail Transp. Plan. Manag. 32: 100488 (2024) - Junfang Li, Haixiao Pan, Weiwei Liu, Yingxue Chen:
Exploring the relationship between the determinants and the ridership decrease of urban rail transit station during the COVID-19 pandemic incorporating spatial heterogeneity. J. Rail Transp. Plan. Manag. 32: 100482 (2024) - Jin Liu, Zhiyuan Lin, Ronghui Liu:
A reinforcement learning approach to solving very-short term train rescheduling problem for a single-track rail corridor. J. Rail Transp. Plan. Manag. 32: 100483 (2024) - Md Sabbir Hossain Muni, Md Moshiur Rahman Khan, Niaz Mahmud Zafri, Mohammed Mojahid Hossain Chowdhury:
Relationships between service quality and customer satisfaction in rail freight transportation: A structural equation modeling approach. J. Rail Transp. Plan. Manag. 32: 100485 (2024) - Evgeniia Shtele, Paolo Beria, Samuel Tolentino:
The evaluation of competition effect on rail fares using the difference-in-difference method through symmetric and lagged spans. J. Rail Transp. Plan. Manag. 32: 100484 (2024) - Ying Wang, Xiaoyong He, Thomas Breugem, Dennis Huisman:
A decomposition approach to solve the individual railway crew Re-planning problem. J. Rail Transp. Plan. Manag. 32: 100487 (2024) - Masoud Yaghini, Hosna Pooladi, Mohammad Karimi:
A Bi-objective model and a branch-and-price-and-cut solution method for the railroad blocking problem in hazardous material transportation. J. Rail Transp. Plan. Manag. 32: 100486 (2024)
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-11-30 00:07 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint