@Proceedings{borndorfer_et_al:OASIcs.ATMOS.2018,
title = {{OASIcs, Volume 65, ATMOS'18, Complete Volume}},
booktitle = {18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-096-5},
ISSN = {2190-6807},
year = {2018},
volume = {65},
editor = {Bornd\"{o}rfer, Ralf and Storandt, Sabine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2018},
URN = {urn:nbn:de:0030-drops-97272},
doi = {10.4230/OASIcs.ATMOS.2018},
annote = {Keywords: Theory of computation, Design and analysis of algorithms, Mathematics of computing, Discrete mathematics, Mathematics of computing, Combinatorics}
}
@InProceedings{borndorfer_et_al:OASIcs.ATMOS.2018.0,
author = {Bornd\"{o}rfer, Ralf and Storandt, Sabine},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)},
pages = {0:i--0:x},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-096-5},
ISSN = {2190-6807},
year = {2018},
volume = {65},
editor = {Bornd\"{o}rfer, Ralf and Storandt, Sabine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2018.0},
URN = {urn:nbn:de:0030-drops-97050},
doi = {10.4230/OASIcs.ATMOS.2018.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{liden:OASIcs.ATMOS.2018.1,
author = {Lid\'{e}n, Tomas},
title = {{Reformulations for Integrated Planning of Railway Traffic and Network Maintenance}},
booktitle = {18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)},
pages = {1:1--1:10},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-096-5},
ISSN = {2190-6807},
year = {2018},
volume = {65},
editor = {Bornd\"{o}rfer, Ralf and Storandt, Sabine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2018.1},
URN = {urn:nbn:de:0030-drops-97065},
doi = {10.4230/OASIcs.ATMOS.2018.1},
annote = {Keywords: Railway scheduling, Maintenance planning, Optimization}
}
@InProceedings{sousa_et_al:OASIcs.ATMOS.2018.2,
author = {Sousa, Nuno and Al\c{c}ada-Almeida, Luis and Coutinho-Rodrigues, Jo\~{a}o},
title = {{Large Scale Railway Renewal Planning with a Multiobjective Modeling Approach}},
booktitle = {18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)},
pages = {2:1--2:9},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-096-5},
ISSN = {2190-6807},
year = {2018},
volume = {65},
editor = {Bornd\"{o}rfer, Ralf and Storandt, Sabine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2018.2},
URN = {urn:nbn:de:0030-drops-97071},
doi = {10.4230/OASIcs.ATMOS.2018.2},
annote = {Keywords: Rail infrastructure, Renewal maintenance, Multiobjective modeling}
}
@InProceedings{vandenbroek_et_al:OASIcs.ATMOS.2018.3,
author = {van den Broek, Roel and Hoogeveen, Han and van den Akker, Marjan},
title = {{How to Measure the Robustness of Shunting Plans}},
booktitle = {18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)},
pages = {3:1--3:13},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-096-5},
ISSN = {2190-6807},
year = {2018},
volume = {65},
editor = {Bornd\"{o}rfer, Ralf and Storandt, Sabine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2018.3},
URN = {urn:nbn:de:0030-drops-97081},
doi = {10.4230/OASIcs.ATMOS.2018.3},
annote = {Keywords: robustness, resource-constrained project scheduling, partial order schedule, uncertainty, Monte Carlo simulation, train shunting}
}
@InProceedings{friedrich_et_al:OASIcs.ATMOS.2018.4,
author = {Friedrich, Markus and M\"{u}ller-Hannemann, Matthias and R\"{u}ckert, Ralf and Schiewe, Alexander and Sch\"{o}bel, Anita},
title = {{Robustness as a Third Dimension for Evaluating Public Transport Plans}},
booktitle = {18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)},
pages = {4:1--4:17},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-096-5},
ISSN = {2190-6807},
year = {2018},
volume = {65},
editor = {Bornd\"{o}rfer, Ralf and Storandt, Sabine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2018.4},
URN = {urn:nbn:de:0030-drops-97097},
doi = {10.4230/OASIcs.ATMOS.2018.4},
annote = {Keywords: robustness, timetabling, vehicle schedules, delays}
}
@InProceedings{hansknecht_et_al:OASIcs.ATMOS.2018.5,
author = {Hansknecht, Christoph and Richter, Alexander and Stiller, Sebastian},
title = {{Fast Robust Shortest Path Computations}},
booktitle = {18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)},
pages = {5:1--5:21},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-096-5},
ISSN = {2190-6807},
year = {2018},
volume = {65},
editor = {Bornd\"{o}rfer, Ralf and Storandt, Sabine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2018.5},
URN = {urn:nbn:de:0030-drops-97100},
doi = {10.4230/OASIcs.ATMOS.2018.5},
annote = {Keywords: Graph Algorithms, Shortest Paths, Robust Optimization}
}
@InProceedings{vanheuvenvanstaereling:OASIcs.ATMOS.2018.6,
author = {van Heuven van Staereling, Irving},
title = {{Tree Decomposition Methods for the Periodic Event Scheduling Problem}},
booktitle = {18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)},
pages = {6:1--6:13},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-096-5},
ISSN = {2190-6807},
year = {2018},
volume = {65},
editor = {Bornd\"{o}rfer, Ralf and Storandt, Sabine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2018.6},
URN = {urn:nbn:de:0030-drops-97112},
doi = {10.4230/OASIcs.ATMOS.2018.6},
annote = {Keywords: Dynamic Programming, Trees, Periodic Event Scheduling Problem}
}
@InProceedings{arizti_et_al:OASIcs.ATMOS.2018.7,
author = {Arizti, Agustin and Mauttone, Antonio and Urquhart, Maria E.},
title = {{A Bilevel Approach to Frequency Optimization in Public Transportation Systems}},
booktitle = {18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)},
pages = {7:1--7:13},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-096-5},
ISSN = {2190-6807},
year = {2018},
volume = {65},
editor = {Bornd\"{o}rfer, Ralf and Storandt, Sabine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2018.7},
URN = {urn:nbn:de:0030-drops-97120},
doi = {10.4230/OASIcs.ATMOS.2018.7},
annote = {Keywords: transportation, public transport capacity, transit frequency optimization, mixed integer linear programming, bilevel programming}
}
@InProceedings{patzold_et_al:OASIcs.ATMOS.2018.8,
author = {P\"{a}tzold, Julius and Schiewe, Alexander and Sch\"{o}bel, Anita},
title = {{Cost-Minimal Public Transport Planning}},
booktitle = {18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)},
pages = {8:1--8:22},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-096-5},
ISSN = {2190-6807},
year = {2018},
volume = {65},
editor = {Bornd\"{o}rfer, Ralf and Storandt, Sabine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2018.8},
URN = {urn:nbn:de:0030-drops-97138},
doi = {10.4230/OASIcs.ATMOS.2018.8},
annote = {Keywords: Public Transport Planning, Integer Optimization, Line Planning, Vehicle Scheduling}
}
@InProceedings{petig_et_al:OASIcs.ATMOS.2018.9,
author = {Petig, Thomas and Schiller, Elad M. and Suomela, Jukka},
title = {{Changing Lanes on a Highway}},
booktitle = {18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)},
pages = {9:1--9:15},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-096-5},
ISSN = {2190-6807},
year = {2018},
volume = {65},
editor = {Bornd\"{o}rfer, Ralf and Storandt, Sabine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2018.9},
URN = {urn:nbn:de:0030-drops-97148},
doi = {10.4230/OASIcs.ATMOS.2018.9},
annote = {Keywords: Collaborative agents, vehicle scheduling, traffic optimization, approximation algorithms}
}
@InProceedings{vanbevern_et_al:OASIcs.ATMOS.2018.10,
author = {van Bevern, Ren\'{e} and Fluschnik, Till and Tsidulko, Oxana Yu.},
title = {{Parameterized Algorithms and Data Reduction for Safe Convoy Routing}},
booktitle = {18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)},
pages = {10:1--10:19},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-096-5},
ISSN = {2190-6807},
year = {2018},
volume = {65},
editor = {Bornd\"{o}rfer, Ralf and Storandt, Sabine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2018.10},
URN = {urn:nbn:de:0030-drops-97157},
doi = {10.4230/OASIcs.ATMOS.2018.10},
annote = {Keywords: NP-hard problem, fixed-parameter tractability, problem kernelization, shortest path, secluded solution}
}
@InProceedings{amarouche_et_al:OASIcs.ATMOS.2018.11,
author = {Amarouche, Youcef and Guibadj, Rym N. and Moukrim, Aziz},
title = {{A Neighborhood Search and Set Cover Hybrid Heuristic for the Two-Echelon Vehicle Routing Problem}},
booktitle = {18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)},
pages = {11:1--11:15},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-096-5},
ISSN = {2190-6807},
year = {2018},
volume = {65},
editor = {Bornd\"{o}rfer, Ralf and Storandt, Sabine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2018.11},
URN = {urn:nbn:de:0030-drops-97161},
doi = {10.4230/OASIcs.ATMOS.2018.11},
annote = {Keywords: Two-Echelon Vehicle Routing Problem, City Logistics, hybrid method, integer programming}
}
@InProceedings{sering_et_al:OASIcs.ATMOS.2018.12,
author = {Sering, Leon and Skutella, Martin},
title = {{Multi-Source Multi-Sink Nash Flows over Time}},
booktitle = {18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)},
pages = {12:1--12:20},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-096-5},
ISSN = {2190-6807},
year = {2018},
volume = {65},
editor = {Bornd\"{o}rfer, Ralf and Storandt, Sabine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2018.12},
URN = {urn:nbn:de:0030-drops-97176},
doi = {10.4230/OASIcs.ATMOS.2018.12},
annote = {Keywords: Network congestion, Nash equilibrium, dynamic routing game, deterministic queuing model}
}
@InProceedings{peis_et_al:OASIcs.ATMOS.2018.13,
author = {Peis, Britta and Tauer, Bjoern and Timmermans, Veerle and Vargas Koch, Laura},
title = {{Oligopolistic Competitive Packet Routing}},
booktitle = {18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)},
pages = {13:1--13:22},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-096-5},
ISSN = {2190-6807},
year = {2018},
volume = {65},
editor = {Bornd\"{o}rfer, Ralf and Storandt, Sabine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2018.13},
URN = {urn:nbn:de:0030-drops-97186},
doi = {10.4230/OASIcs.ATMOS.2018.13},
annote = {Keywords: Competitive Packet Routing, Nash Equilibrium, Oligopoly, Efficiency of Equilibria, Priority Policy}
}
@InProceedings{mannino_et_al:OASIcs.ATMOS.2018.14,
author = {Mannino, Carlo and Sartor, Giorgio},
title = {{The Path\&Cycle Formulation for the Hotspot Problem in Air Traffic Management}},
booktitle = {18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)},
pages = {14:1--14:11},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-096-5},
ISSN = {2190-6807},
year = {2018},
volume = {65},
editor = {Bornd\"{o}rfer, Ralf and Storandt, Sabine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2018.14},
URN = {urn:nbn:de:0030-drops-97191},
doi = {10.4230/OASIcs.ATMOS.2018.14},
annote = {Keywords: Air Traffic Management, Hotspot Problem, Job-shop scheduling, Mixed Integer Linear Programming}
}
@InProceedings{vanlieshout_et_al:OASIcs.ATMOS.2018.15,
author = {van Lieshout, Rolf N. and Bouman, Paul C.},
title = {{Vehicle Scheduling Based on a Line Plan}},
booktitle = {18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)},
pages = {15:1--15:14},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-096-5},
ISSN = {2190-6807},
year = {2018},
volume = {65},
editor = {Bornd\"{o}rfer, Ralf and Storandt, Sabine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2018.15},
URN = {urn:nbn:de:0030-drops-97204},
doi = {10.4230/OASIcs.ATMOS.2018.15},
annote = {Keywords: Vehicle scheduling, integrated railway planning, (fractional) matching, treewidth}
}
@InProceedings{borndorfer_et_al:OASIcs.ATMOS.2018.16,
author = {Bornd\"{o}rfer, Ralf and Karbstein, Marika and Liebchen, Christian and Lindner, Niels},
title = {{A Simple Way to Compute the Number of Vehicles That Are Required to Operate a Periodic Timetable}},
booktitle = {18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)},
pages = {16:1--16:15},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-096-5},
ISSN = {2190-6807},
year = {2018},
volume = {65},
editor = {Bornd\"{o}rfer, Ralf and Storandt, Sabine},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2018.16},
URN = {urn:nbn:de:0030-drops-97214},
doi = {10.4230/OASIcs.ATMOS.2018.16},
annote = {Keywords: Vehicle Scheduling, Periodic Timetabling, Bipartite Matching}
}
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