default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID21st ATMOS 2021: Lisbon, Portugal (Virtual Conference)
- Matthias Müller-Hannemann
, Federico Perea:
21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2021, September 9-10, 2021, Lisbon, Portugal (Virtual Conference). OASIcs 96, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-213-6 - Carlo S. Sartori, Pieter Smet, Greet Vanden Berghe:
Efficient Duration-Based Workload Balancing for Interdependent Vehicle Routes. 1:1-1:15 - Niels Lindner, Christian Liebchen, Berenike Masing:
Forward Cycle Bases and Periodic Timetabling. 2:1-2:14 - Matthias Müller-Hannemann, Ralf Rückert, Alexander Schiewe, Anita Schöbel:
Towards Improved Robustness of Public Transport by a Machine-Learned Oracle. 3:1-3:20 - Syu-Ning Johnn, Yiran Zhu, Andrés Miniguano-Trujillo, Akshay Gupte:
Solving the Home Service Assignment, Routing, and Appointment Scheduling (H-SARA) Problem with Uncertainties. 4:1-4:21 - Elia Costa, Francesco Silvestri:
On the Bike Spreading Problem. 5:1-5:16 - Marc Goerigk, Anita Schöbel, Felix Spühler:
A Phase I Simplex Method for Finding Feasible Periodic Timetables. 6:1-6:13 - Niels Lindner, Pedro Maristany de las Casas, Philine Schiewe:
Optimal Forks: Preprocessing Single-Source Shortest Path Instances with Interval Data. 7:1-7:15 - Daniela Gaul, Kathrin Klamroth, Michael Stiglmayr:
Solving the Dynamic Dial-a-Ride Problem Using a Rolling-Horizon Event-Based Graph. 8:1-8:16 - Vera Grafe, Anita Schöbel:
Solving the Periodic Scheduling Problem: An Assignment Approach in Non-Periodic Networks. 9:1-9:16 - Daniel Chen, Christian Sommer, Daniel Wolleb:
Fast Map Matching with Vertex-Monotone Fréchet Distance. 10:1-10:20 - Payas Rajan, Moritz Baum, Michael Wegner, Tobias Zündorf, Christian J. West, Dennis Schieferdecker, Daniel Delling:
Robustness Generalizations of the Shortest Feasible Path Problem for Electric Vehicles. 11:1-11:18 - Marco Silva, João Pedro Pedroso, Ana Viana, Xenia Klimentova:
A Branch-Price-And-Cut Algorithm for Stochastic Crowd Shipping Last-Mile Delivery with Correlated Marginals. 12:1-12:20 - Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh, Junichi Teruyama:
Locating Evacuation Centers Optimally in Path and Cycle Networks. 13:1-13:19 - Peter Damaschke:
Distance-Based Solution of Patrolling Problems with Individual Waiting Times. 14:1-14:14 - Vassilissa Lehoux-Lebacque, Christelle Loiodice:
Transfer Customization with the Trip-Based Public Transit Routing Algorithm. 15:1-15:17 - Diptendu Chatterjee, Bimal Kumar Roy:
An Improved Scheduling Algorithm for Traveling Tournament Problem with Maximum Trip Length Two. 16:1-16:15 - Güvenç Sahin, Amin Ahmadi Digehsara, Ralf Borndörfer:
Efficient Algorithms for the Multi-Period Line Planning Problem in Public Transportation (Short Paper). 17:1-17:6 - Natividad González-Blanco, Antonio J. Lozano, Vladimir Marianov, Juan A. Mesa:
An Integrated Model for Rapid and Slow Transit Network Design (Short Paper). 18:1-18:6 - Hector Gatt, Jean-Marie Freche, Fabien Lehuédé, Thomas G. Yeung:
A Column Generation-Based Heuristic for the Line Planning Problem with Service Levels (Short Paper). 19:1-19:6
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.
last updated on 2024-11-25 22:50 CET 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:
