<h2>OASIcs, Volume 123, ATMOS 2024</h2>
<ul>
<li>
<span class="authors">Paul C. Bouman and Spyros C. Kontogiannis</span>
<span class="title">OASIcs, Volume 123, ATMOS 2024, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2024">10.4230/OASIcs.ATMOS.2024</a>
</li>
<li>
<span class="authors">Paul C. Bouman and Spyros C. Kontogiannis</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2024.0">10.4230/OASIcs.ATMOS.2024.0</a>
</li>
<li>
<span class="authors">Justine Cauvi, Ruoying Li, and Sabine Storandt</span>
<span class="title">Landmark Hub Labeling: Improved Bounds and Faster Query Answering</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2024.1">10.4230/OASIcs.ATMOS.2024.1</a>
</li>
<li>
<span class="authors">David Coudert, Andrea D'Ascenzo, and Mattia D'Emidio</span>
<span class="title">Indexing Graphs for Shortest Beer Path Queries</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2024.2">10.4230/OASIcs.ATMOS.2024.2</a>
</li>
<li>
<span class="authors">Jenny Enerbäck, Lukas Eveborn, and Elina Rönnberg</span>
<span class="title">Pricing for the EVRPTW with Piecewise Linear Charging by a Bounding-Based Labeling Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2024.3">10.4230/OASIcs.ATMOS.2024.3</a>
</li>
<li>
<span class="authors">Enrico Bortoletto, Rolf Nelson van Lieshout, Berenike Masing, and Niels Lindner</span>
<span class="title">Periodic Event Scheduling with Flexible Infrastructure Assignment</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2024.4">10.4230/OASIcs.ATMOS.2024.4</a>
</li>
<li>
<span class="authors">Héloïse Gachet and Frédéric Meunier</span>
<span class="title">Balanced Assignments of Periodic Tasks</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2024.5">10.4230/OASIcs.ATMOS.2024.5</a>
</li>
<li>
<span class="authors">Tomas Lidén, Christiane Schmidt, and Rabii Zahir</span>
<span class="title">Two-Stage Weekly Shift Scheduling for Train Dispatchers</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2024.6">10.4230/OASIcs.ATMOS.2024.6</a>
</li>
<li>
<span class="authors">Gianlorenzo D'Angelo, Mattia D'Emidio, Esmaeil Delfaraz, and Gabriele Di Stefano</span>
<span class="title">Improved Algorithms for the Capacitated Team Orienteering Problem</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2024.7">10.4230/OASIcs.ATMOS.2024.7</a>
</li>
<li>
<span class="authors">Barbara M. Anthony, Christine Chung, Ananya Das, and David Yuen</span>
<span class="title">New Bounds on the Performance of SBP for the Dial-a-Ride Problem with Revenues (Short Paper)</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2024.8">10.4230/OASIcs.ATMOS.2024.8</a>
</li>
<li>
<span class="authors">Spyros Kontogiannis, Andreas Paraskevopoulos, and Christos Zaroliagis</span>
<span class="title">Online Vehicle Routing with Pickups and Deliveries Under Time-Dependent Travel-Time Constraints</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2024.9">10.4230/OASIcs.ATMOS.2024.9</a>
</li>
<li>
<span class="authors">Sven Jäger, Sarah Roth, and Anita Schöbel</span>
<span class="title">Periodic Timetabling: Travel Time vs. Regenerative Energy</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2024.10">10.4230/OASIcs.ATMOS.2024.10</a>
</li>
<li>
<span class="authors">Ralf Borndörfer, Andreas Löbel, Fabian Löbel, and Steffen Weider</span>
<span class="title">Solving the Electric Bus Scheduling Problem by an Integrated Flow and Set Partitioning Approach</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2024.11">10.4230/OASIcs.ATMOS.2024.11</a>
</li>
<li>
<span class="authors">Stefan Engels and Robert Wille</span>
<span class="title">Towards an Optimization Pipeline for the Design of Train Control Systems with Hybrid Train Detection (Short Paper)</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2024.12">10.4230/OASIcs.ATMOS.2024.12</a>
</li>
<li>
<span class="authors">Felix Prause and Ralf Borndörfer</span>
<span class="title">A Bayesian Rolling Horizon Approach for Rolling Stock Rotation Planning with Predictive Maintenance</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2024.13">10.4230/OASIcs.ATMOS.2024.13</a>
</li>
<li>
<span class="authors">Kendra Reiter, Marie Schmidt, and Michael Stiglmayr</span>
<span class="title">The Line-Based Dial-a-Ride Problem</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2024.14">10.4230/OASIcs.ATMOS.2024.14</a>
</li>
<li>
<span class="authors">Philine Schiewe, Anita Schöbel, and Reena Urban</span>
<span class="title">A Bi-Objective Optimization Model for Fare Structure Design in Public Transport</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2024.15">10.4230/OASIcs.ATMOS.2024.15</a>
</li>
<li>
<span class="authors">Antoine Thébault, Loïc Hélouët, and Kenza Saiah</span>
<span class="title">Modeling Subway Networks and Passenger Flows</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2024.16">10.4230/OASIcs.ATMOS.2024.16</a>
</li>
<li>
<span class="authors">Tobias Harks, Sven Jäger, Michael Markl, and Philine Schiewe</span>
<span class="title">Computing User Equilibria for Schedule-Based Transit Networks with Hard Vehicle Capacities</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2024.17">10.4230/OASIcs.ATMOS.2024.17</a>
</li>
<li>
<span class="authors">Julian Patzner and Matthias Müller-Hannemann</span>
<span class="title">Dynamic Traffic Assignment for Public Transport with Vehicle Capacities</span>
<a class="doi" href="https://doi.org/10.4230/OASIcs.ATMOS.2024.18">10.4230/OASIcs.ATMOS.2024.18</a>
</li>
</ul>
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