@Proceedings{frigioni_et_al:OASIcs.ATMOS.2013,
title = {{OASIcs, Volume 33, ATMOS'13, Complete Volume}},
booktitle = {13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-58-3},
ISSN = {2190-6807},
year = {2013},
volume = {33},
editor = {Frigioni, Daniele and Stiller, Sebastian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2013},
URN = {urn:nbn:de:0030-drops-42535},
doi = {10.4230/OASIcs.ATMOS.2013},
annote = {Keywords: Analysis of Algorithms and Problem Complexity, Optimization, Graph Theory, Applications}
}
@InProceedings{frigioni_et_al:OASIcs.ATMOS.2013.i,
author = {Frigioni, Daniele and Stiller, Sebastian},
title = {{Frontmatter, Table of Contents, Preface, Workshop Organization}},
booktitle = {13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems},
pages = {i--xii},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-58-3},
ISSN = {2190-6807},
year = {2013},
volume = {33},
editor = {Frigioni, Daniele and Stiller, Sebastian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2013.i},
URN = {urn:nbn:de:0030-drops-42391},
doi = {10.4230/OASIcs.ATMOS.2013.i},
annote = {Keywords: Frontmatter, Table of Contents, Preface, Workshop Organization}
}
@InProceedings{goerigk_et_al:OASIcs.ATMOS.2013.1,
author = {Goerigk, Marc and He{\ss}e, Sacha and M\"{u}ller-Hannemann, Matthias and Schmidt, Marie and Sch\"{o}bel, Anita},
title = {{Recoverable Robust Timetable Information}},
booktitle = {13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems},
pages = {1--14},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-58-3},
ISSN = {2190-6807},
year = {2013},
volume = {33},
editor = {Frigioni, Daniele and Stiller, Sebastian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2013.1},
URN = {urn:nbn:de:0030-drops-42407},
doi = {10.4230/OASIcs.ATMOS.2013.1},
annote = {Keywords: timetable information, recoverable robustness, delay scenarios}
}
@InProceedings{firmani_et_al:OASIcs.ATMOS.2013.15,
author = {Firmani, Donatella and Italiano, Giuseppe F. and Laura, Luigi and Santaroni, Federico},
title = {{Is Timetabling Routing Always Reliable for Public Transport?}},
booktitle = {13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems},
pages = {15--26},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-58-3},
ISSN = {2190-6807},
year = {2013},
volume = {33},
editor = {Frigioni, Daniele and Stiller, Sebastian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2013.15},
URN = {urn:nbn:de:0030-drops-42415},
doi = {10.4230/OASIcs.ATMOS.2013.15},
annote = {Keywords: Shortest Path Problems, Route Planning, Timetable-based Routing, Public Transport Networks}
}
@InProceedings{bohmova_et_al:OASIcs.ATMOS.2013.27,
author = {B\"{o}hmov\'{a}, Katerina and Mihal\'{a}k, Mat\'{u}s and Pr\"{o}ger, Tobias and Sr\'{a}mek, Rastislav and Widmayer, Peter},
title = {{Robust Routing in Urban Public Transportation: How to Find Reliable Journeys Based on Past Observations}},
booktitle = {13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems},
pages = {27--41},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-58-3},
ISSN = {2190-6807},
year = {2013},
volume = {33},
editor = {Frigioni, Daniele and Stiller, Sebastian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2013.27},
URN = {urn:nbn:de:0030-drops-42428},
doi = {10.4230/OASIcs.ATMOS.2013.27},
annote = {Keywords: Algorithms, Optimization, Robustness, Route planning, Public transportation}
}
@InProceedings{bast_et_al:OASIcs.ATMOS.2013.42,
author = {Bast, Hannah and Sternisko, Jonas and Storandt, Sabine},
title = {{Delay-Robustness of Transfer Patterns in Public Transportation Route Planning}},
booktitle = {13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems},
pages = {42--54},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-58-3},
ISSN = {2190-6807},
year = {2013},
volume = {33},
editor = {Frigioni, Daniele and Stiller, Sebastian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2013.42},
URN = {urn:nbn:de:0030-drops-42434},
doi = {10.4230/OASIcs.ATMOS.2013.42},
annote = {Keywords: Route planning, public transportation, transfer patterns, delay, robustness}
}
@InProceedings{sadykov_et_al:OASIcs.ATMOS.2013.55,
author = {Sadykov, Ruslan and Lazarev, Alexander A. and Shiryaev, Vitaliy and Stratonnikov, Alexey},
title = {{Solving a Freight Railcar Flow Problem Arising in Russia}},
booktitle = {13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems},
pages = {55--67},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-58-3},
ISSN = {2190-6807},
year = {2013},
volume = {33},
editor = {Frigioni, Daniele and Stiller, Sebastian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2013.55},
URN = {urn:nbn:de:0030-drops-42448},
doi = {10.4230/OASIcs.ATMOS.2013.55},
annote = {Keywords: Freight routing, multi-commodity flow, column generation}
}
@InProceedings{borndorfer_et_al:OASIcs.ATMOS.2013.68,
author = {Bornd\"{o}rfer, Ralf and Hoppmann, Heide and Karbstein, Marika},
title = {{A Configuration Model for the Line Planning Problem}},
booktitle = {13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems},
pages = {68--79},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-58-3},
ISSN = {2190-6807},
year = {2013},
volume = {33},
editor = {Frigioni, Daniele and Stiller, Sebastian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2013.68},
URN = {urn:nbn:de:0030-drops-42451},
doi = {10.4230/OASIcs.ATMOS.2013.68},
annote = {Keywords: Combinatorial optimization, polyhedral combinatorics, line planning}
}
@InProceedings{carrizosa_et_al:OASIcs.ATMOS.2013.80,
author = {Carrizosa, Emilio and Harbering, Jonas and Sch\"{o}bel, Anita},
title = {{The Stop Location Problem with Realistic Traveling Time}},
booktitle = {13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems},
pages = {80--93},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-58-3},
ISSN = {2190-6807},
year = {2013},
volume = {33},
editor = {Frigioni, Daniele and Stiller, Sebastian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2013.80},
URN = {urn:nbn:de:0030-drops-42467},
doi = {10.4230/OASIcs.ATMOS.2013.80},
annote = {Keywords: Stop Location, Realistic Traveling Time, IP Formulation}
}
@InProceedings{kobitzsch_et_al:OASIcs.ATMOS.2013.94,
author = {Kobitzsch, Moritz and Radermacher, Marcel and Schieferdecker, Dennis},
title = {{Evolution and Evaluation of the Penalty Method for Alternative Graphs}},
booktitle = {13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems},
pages = {94--107},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-58-3},
ISSN = {2190-6807},
year = {2013},
volume = {33},
editor = {Frigioni, Daniele and Stiller, Sebastian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2013.94},
URN = {urn:nbn:de:0030-drops-42474},
doi = {10.4230/OASIcs.ATMOS.2013.94},
annote = {Keywords: Alternatives, Routing, Shortest Paths, Penalties, Parallelization}
}
@InProceedings{paraskevopoulos_et_al:OASIcs.ATMOS.2013.108,
author = {Paraskevopoulos, Andreas and Zaroliagis, Christos},
title = {{Improved Alternative Route Planning}},
booktitle = {13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems},
pages = {108--122},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-58-3},
ISSN = {2190-6807},
year = {2013},
volume = {33},
editor = {Frigioni, Daniele and Stiller, Sebastian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2013.108},
URN = {urn:nbn:de:0030-drops-42485},
doi = {10.4230/OASIcs.ATMOS.2013.108},
annote = {Keywords: Alternative route, stretch factor, shortest path, non-overlapping path, penalty, plateau}
}
@InProceedings{bast_et_al:OASIcs.ATMOS.2013.123,
author = {Bast, Hannah and Brodesser, Mirko and Storandt, Sabine},
title = {{Result Diversity for Multi-Modal Route Planning}},
booktitle = {13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems},
pages = {123--136},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-58-3},
ISSN = {2190-6807},
year = {2013},
volume = {33},
editor = {Frigioni, Daniele and Stiller, Sebastian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2013.123},
URN = {urn:nbn:de:0030-drops-42494},
doi = {10.4230/OASIcs.ATMOS.2013.123},
annote = {Keywords: Route Planning, Multi-Modal, Result Diversity}
}
@InProceedings{sarpong_et_al:OASIcs.ATMOS.2013.137,
author = {Sarpong, Boadu Mensah and Artigues, Christian and Jozefowiez, Nicolas},
title = {{Column Generation for Bi-Objective Vehicle Routing Problems with a Min-Max Objective}},
booktitle = {13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems},
pages = {137--149},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-58-3},
ISSN = {2190-6807},
year = {2013},
volume = {33},
editor = {Frigioni, Daniele and Stiller, Sebastian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2013.137},
URN = {urn:nbn:de:0030-drops-42500},
doi = {10.4230/OASIcs.ATMOS.2013.137},
annote = {Keywords: Multi-objective optimization, column generation, integer programming, vehicle routing}
}
@InProceedings{bitmonnot_et_al:OASIcs.ATMOS.2013.150,
author = {Bit-Monnot, Arthur and Artigues, Christian and Huguet, Marie-Jos\'{e} and Killijian, Marc-Olivier},
title = {{Carpooling: the 2 Synchronization Points Shortest Paths Problem}},
booktitle = {13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems},
pages = {150--163},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-58-3},
ISSN = {2190-6807},
year = {2013},
volume = {33},
editor = {Frigioni, Daniele and Stiller, Sebastian},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2013.150},
URN = {urn:nbn:de:0030-drops-42517},
doi = {10.4230/OASIcs.ATMOS.2013.150},
annote = {Keywords: Dynamic Carpooling, Shortest Path Problem, Synchronized Paths}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing