@Proceedings{italiano_et_al:OASIcs.ATMOS.2015,
title = {{OASIcs, Volume 48, ATMOS'15, Complete Volume}},
booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-99-6},
ISSN = {2190-6807},
year = {2015},
volume = {48},
editor = {Italiano, Giuseppe F. and Schmidt, Marie},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2015},
URN = {urn:nbn:de:0030-drops-54712},
doi = {10.4230/OASIcs.ATMOS.2015},
annote = {Keywords: Analysis of Algorithms and Problem Complexity, Optimization, Combinatorics, Graph Theory, Applications}
}
@InProceedings{italiano_et_al:OASIcs.ATMOS.2015.i,
author = {Italiano, Giuseppe F. and Schmidt, Marie},
title = {{Front Matter, Table of Contents, Preface, Organization}},
booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)},
pages = {i--x},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-99-6},
ISSN = {2190-6807},
year = {2015},
volume = {48},
editor = {Italiano, Giuseppe F. and Schmidt, Marie},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2015.i},
URN = {urn:nbn:de:0030-drops-54505},
doi = {10.4230/OASIcs.ATMOS.2015.i},
annote = {Keywords: Front Matter, Table of Contents, Preface, Organization}
}
@InProceedings{andreev_et_al:OASIcs.ATMOS.2015.1,
author = {Andreev, Simeon and Dibbelt, Julian and N\"{o}llenburg, Martin and Pajor, Thomas and Wagner, Dorothea},
title = {{Towards Realistic Pedestrian Route Planning}},
booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)},
pages = {1--15},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-99-6},
ISSN = {2190-6807},
year = {2015},
volume = {48},
editor = {Italiano, Giuseppe F. and Schmidt, Marie},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2015.1},
URN = {urn:nbn:de:0030-drops-54592},
doi = {10.4230/OASIcs.ATMOS.2015.1},
annote = {Keywords: pedestrian routing, realistic model, shortest paths, speed-up technique}
}
@InProceedings{hrncir_et_al:OASIcs.ATMOS.2015.16,
author = {Hrncir, Jan and Zilecky, Pavol and Song, Qing and Jakob, Michal},
title = {{Speedups for Multi-Criteria Urban Bicycle Routing}},
booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)},
pages = {16--28},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-99-6},
ISSN = {2190-6807},
year = {2015},
volume = {48},
editor = {Italiano, Giuseppe F. and Schmidt, Marie},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2015.16},
URN = {urn:nbn:de:0030-drops-54584},
doi = {10.4230/OASIcs.ATMOS.2015.16},
annote = {Keywords: bicycle routing, multi-criteria shortest path, heuristic speedups}
}
@InProceedings{merting_et_al:OASIcs.ATMOS.2015.29,
author = {Merting, S\"{o}ren and Schwan, Christian and Strehler, Martin},
title = {{Routing of Electric Vehicles: Constrained Shortest Path Problems with Resource Recovering Nodes}},
booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)},
pages = {29--41},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-99-6},
ISSN = {2190-6807},
year = {2015},
volume = {48},
editor = {Italiano, Giuseppe F. and Schmidt, Marie},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2015.29},
URN = {urn:nbn:de:0030-drops-54559},
doi = {10.4230/OASIcs.ATMOS.2015.29},
annote = {Keywords: routing of electric vehicles, constrained shortest paths, FPTAS, con- strained network flow}
}
@InProceedings{paulsen_et_al:OASIcs.ATMOS.2015.42,
author = {Paulsen, Niklas and Diedrich, Florian and Jansen, Klaus},
title = {{Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows}},
booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)},
pages = {42--55},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-99-6},
ISSN = {2190-6807},
year = {2015},
volume = {48},
editor = {Italiano, Giuseppe F. and Schmidt, Marie},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2015.42},
URN = {urn:nbn:de:0030-drops-54608},
doi = {10.4230/OASIcs.ATMOS.2015.42},
annote = {Keywords: TSPTW, minimum tour duration, dynamic programming, heuristics}
}
@InProceedings{takaoka:OASIcs.ATMOS.2015.56,
author = {Takaoka, Tadao},
title = {{Single Source Shortest Paths for All Flows with Integer Costs}},
booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)},
pages = {56--67},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-99-6},
ISSN = {2190-6807},
year = {2015},
volume = {48},
editor = {Italiano, Giuseppe F. and Schmidt, Marie},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2015.56},
URN = {urn:nbn:de:0030-drops-54611},
doi = {10.4230/OASIcs.ATMOS.2015.56},
annote = {Keywords: information sharing, shortest path problem for all flows, priority queue, limited edge cost, transportation network}
}
@InProceedings{bohmova_et_al:OASIcs.ATMOS.2015.68,
author = {B\"{o}hmov\'{a}, Katerina and Mihal\'{a}k, Mat\'{u}\v{s} and Neubert, Peggy and Pr\"{o}ger, Tobias and Widmayer, Peter},
title = {{Robust Routing in Urban Public Transportation: Evaluating Strategies that Learn From the Past}},
booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)},
pages = {68--81},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-99-6},
ISSN = {2190-6807},
year = {2015},
volume = {48},
editor = {Italiano, Giuseppe F. and Schmidt, Marie},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2015.68},
URN = {urn:nbn:de:0030-drops-54542},
doi = {10.4230/OASIcs.ATMOS.2015.68},
annote = {Keywords: public transportation, route planning, robustness, optimization, experiments}
}
@InProceedings{mihalak_et_al:OASIcs.ATMOS.2015.82,
author = {Mihal\'{a}k, Mat\'{u}\v{s} and Montanari, Sandro},
title = {{Bi-directional Search for Robust Routes in Time-dependent Bi-criteria Road Networks}},
booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)},
pages = {82--94},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-99-6},
ISSN = {2190-6807},
year = {2015},
volume = {48},
editor = {Italiano, Giuseppe F. and Schmidt, Marie},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2015.82},
URN = {urn:nbn:de:0030-drops-54561},
doi = {10.4230/OASIcs.ATMOS.2015.82},
annote = {Keywords: shortest path, time-dependent, bi-criteria, bi-directional search, min-max relative regret}
}
@InProceedings{gutierrezjarpa_et_al:OASIcs.ATMOS.2015.95,
author = {Guti\'{e}rrez-Jarpa, Gabriel and Laporte, Gilbert and Marianov, Vladimir and Moccia, Luigi},
title = {{A Mixed Integer Linear Program for the Rapid Transit Network Design Problem with Static Modal Competition}},
booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)},
pages = {95--96},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-99-6},
ISSN = {2190-6807},
year = {2015},
volume = {48},
editor = {Italiano, Giuseppe F. and Schmidt, Marie},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2015.95},
URN = {urn:nbn:de:0030-drops-54519},
doi = {10.4230/OASIcs.ATMOS.2015.95},
annote = {Keywords: metro network design, multi-objective optimization, modal competition}
}
@InProceedings{fischer:OASIcs.ATMOS.2015.97,
author = {Fischer, Frank},
title = {{Ordering Constraints in Time Expanded Networks for Train Timetabling Problems}},
booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)},
pages = {97--110},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-99-6},
ISSN = {2190-6807},
year = {2015},
volume = {48},
editor = {Italiano, Giuseppe F. and Schmidt, Marie},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2015.97},
URN = {urn:nbn:de:0030-drops-54524},
doi = {10.4230/OASIcs.ATMOS.2015.97},
annote = {Keywords: combinatorial optimization, train timetabling, Lagrangian relaxation, ordering constraints}
}
@InProceedings{borndorfer_et_al:OASIcs.ATMOS.2015.111,
author = {Bornd\"{o}rfer, Ralf and Reuther, Markus},
title = {{Regional Search for the Resource Constrained Assignment Problem}},
booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)},
pages = {111--129},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-99-6},
ISSN = {2190-6807},
year = {2015},
volume = {48},
editor = {Italiano, Giuseppe F. and Schmidt, Marie},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2015.111},
URN = {urn:nbn:de:0030-drops-54536},
doi = {10.4230/OASIcs.ATMOS.2015.111},
annote = {Keywords: assignment problem, local search, branch and bound, rolling stock rota- tion problem, vehicle routing problem}
}
@InProceedings{vanbevern_et_al:OASIcs.ATMOS.2015.130,
author = {van Bevern, Ren\'{e} and Komusiewicz, Christian and Sorge, Manuel},
title = {{Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems}},
booktitle = {15th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2015)},
pages = {130--143},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-939897-99-6},
ISSN = {2190-6807},
year = {2015},
volume = {48},
editor = {Italiano, Giuseppe F. and Schmidt, Marie},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2015.130},
URN = {urn:nbn:de:0030-drops-54575},
doi = {10.4230/OASIcs.ATMOS.2015.130},
annote = {Keywords: vehicle routing, transportation, Rural Postman, Chinese Postman, NP- hard problem, parameterized algorithm, combinatorial optimization}
}
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