<h2>Dagstuhl Seminar Proceedings, Volume 9261, </h2>
<ul>
<li>
<span class="authors">Cynthia Barnhart, Uwe Clausen, Ulrich Lauther, and Rolf H. Möhring</span>
<span class="title">09261 Abstracts Collection – Models and Algorithms for Optimization in Logistics</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09261.1">10.4230/DagSemProc.09261.1</a>
</li>
<li>
<span class="authors">Cynthia Barnhart, Uwe Clausen, Ulrich Lauther, and Rolf H. Möhring</span>
<span class="title">09261 Executive Summary – Models and Algorithms for Optimization in Logistics</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09261.2">10.4230/DagSemProc.09261.2</a>
</li>
<li>
<span class="authors">Anton J. Kleywegt, Jinpyo Lee, and Amy R. Ward</span>
<span class="title">A Network Design Problem</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09261.3">10.4230/DagSemProc.09261.3</a>
</li>
<li>
<span class="authors">Martin Skutella and Jose Verschae</span>
<span class="title">A Robust PTAS for the Parallel Machine Covering Problem</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09261.4">10.4230/DagSemProc.09261.4</a>
</li>
<li>
<span class="authors">Josef Kallrath</span>
<span class="title">Aspects and Views on Mathematical Optimization in Logistics in the Chemical Process Industry</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09261.5">10.4230/DagSemProc.09261.5</a>
</li>
<li>
<span class="authors">Jakob Puchinger, Peter Stuckey, Mark Wallace, and Sebastian Brand</span>
<span class="title">Branch-and-Price Solving in G12</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09261.6">10.4230/DagSemProc.09261.6</a>
</li>
<li>
<span class="authors">Boris Naujoks and Annette Chmielewski</span>
<span class="title">Comparing Different Approaches on the Door Assignment Problem in LTL-Terminals</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09261.7">10.4230/DagSemProc.09261.7</a>
</li>
<li>
<span class="authors">Bernard Gendron, Paul-Virak Khuong, and Frédéric Semet</span>
<span class="title">Formulations, Bounds and Heuristic Methods for a Two-Echelon Adaptive Location-Distribution Problem</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09261.8">10.4230/DagSemProc.09261.8</a>
</li>
<li>
<span class="authors">Marie-Claude Cote, Bernard Gendron, and Louis-Martin Rousseau</span>
<span class="title">Grammar-Based Integer Programing Models for Multi-Activity Shift Scheduling</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09261.9">10.4230/DagSemProc.09261.9</a>
</li>
<li>
<span class="authors">Ozlem Ergun, Gonca Karakus, Pinar Keskinocak, Julie Swann, and Monica Villarreal</span>
<span class="title">Humanitarian Supply Chain Management - An Overview</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09261.10">10.4230/DagSemProc.09261.10</a>
</li>
<li>
<span class="authors">Benjamin Hiller, Torsten Klug, and Andreas Tuchscherer</span>
<span class="title">Improving the perfomance of elevator systems using exact reoptimization algorithms</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09261.11">10.4230/DagSemProc.09261.11</a>
</li>
<li>
<span class="authors">Leena Suhl, Viktor Dück, and Natalia Kliewer</span>
<span class="title">Increasing Stability of Crew Schedules in Airlines</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09261.12">10.4230/DagSemProc.09261.12</a>
</li>
<li>
<span class="authors">Ronny Hansmann and Uwe Zimmermann</span>
<span class="title">Integrated Vehicle Routing and Crew Scheduling in Waste Management (Part I)</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09261.13">10.4230/DagSemProc.09261.13</a>
</li>
<li>
<span class="authors">Jens Baudach, Annette Chmielewski, and Uwe Clausen</span>
<span class="title">Integrated Vehicle Routing and Crew Scheduling in Waste Management (Part II)</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09261.14">10.4230/DagSemProc.09261.14</a>
</li>
<li>
<span class="authors">Ralf Borndörfer, Marika Neumann, and Marc E. Pfetsch</span>
<span class="title">Line Planning and Connectivity</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09261.15">10.4230/DagSemProc.09261.15</a>
</li>
<li>
<span class="authors">Melda Ormeci Matoglu and John Vande Vate</span>
<span class="title">Managing Capacity by Drift Control</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09261.16">10.4230/DagSemProc.09261.16</a>
</li>
<li>
<span class="authors">Christoph Helmberg</span>
<span class="title">Network Models with Convex Cost Structure like Bundle Methods</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09261.17">10.4230/DagSemProc.09261.17</a>
</li>
<li>
<span class="authors">Stefan Irnich</span>
<span class="title">New Models and Methods for Arc Routing</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09261.18">10.4230/DagSemProc.09261.18</a>
</li>
<li>
<span class="authors">Patrick Jaillet and Xin Lu</span>
<span class="title">Online Traveling Salesman Problems with Flexibility</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09261.19">10.4230/DagSemProc.09261.19</a>
</li>
<li>
<span class="authors">Cynthia Barnhart, Hai Jiang, and Lavanya Marla</span>
<span class="title">OPTIMIZATION APPROACHES TO AIRLINE INDUSTRY CHALLENGES: Airline Schedule Planning and Recovery</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09261.20">10.4230/DagSemProc.09261.20</a>
</li>
<li>
<span class="authors">Hanno Schuelldorf</span>
<span class="title">Optimization at Deutsche Bahn: Aspects and Examples</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09261.21">10.4230/DagSemProc.09261.21</a>
</li>
<li>
<span class="authors">Christoph Hempsch</span>
<span class="title">Optimization of mail collection networks</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09261.22">10.4230/DagSemProc.09261.22</a>
</li>
<li>
<span class="authors">Peter Buchholz</span>
<span class="title">Optimization of Stochastic Discrete Event Simulation Models</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09261.23">10.4230/DagSemProc.09261.23</a>
</li>
<li>
<span class="authors">Wilhelm Dangelmaier and Bastian Degener</span>
<span class="title">Production planning and control with discrete lotsizing and a rolling horizon</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09261.24">10.4230/DagSemProc.09261.24</a>
</li>
<li>
<span class="authors">Armin Fügenschuh, Henning Homfeld, and Hanno Schuelldorf</span>
<span class="title">Routing Cars in Rail Freight Service</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09261.25">10.4230/DagSemProc.09261.25</a>
</li>
<li>
<span class="authors">Wiebke Höhn, Felix G. König, Marco E. Lübbecke, and Rolf H. Möhring</span>
<span class="title">Sequencing and Scheduling in Coil Coating with Shuttles</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09261.26">10.4230/DagSemProc.09261.26</a>
</li>
<li>
<span class="authors">Andreas S. Schulz and Nelson A. Uhan</span>
<span class="title">Sharing Supermodular Costs</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09261.27">10.4230/DagSemProc.09261.27</a>
</li>
<li>
<span class="authors">Kati Kasper-Brauer</span>
<span class="title">Standard Software for Supply Chain Design and Optimization</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09261.28">10.4230/DagSemProc.09261.28</a>
</li>
<li>
<span class="authors">Constantin Gaul, Sascha Kurz, and Jörg Rambau</span>
<span class="title">The Combinatorics of (S,M,L,XL) or the best fitting delivery of T-shirts</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09261.29">10.4230/DagSemProc.09261.29</a>
</li>
<li>
<span class="authors">Dennis Huisman</span>
<span class="title">The New Dutch Timetable: The OR Revolution</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09261.30">10.4230/DagSemProc.09261.30</a>
</li>
<li>
<span class="authors">Armin Fügenschuh, Björn Geißler, Alexander Martin, and Antonio Morsi</span>
<span class="title">The Transport PDE and Mixed-Integer Linear Programming</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09261.31">10.4230/DagSemProc.09261.31</a>
</li>
<li>
<span class="authors">Sascha Wohlgemuth</span>
<span class="title">Traffic Information and Dynamic Vehicle Routing in Forwarding Agencies</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09261.32">10.4230/DagSemProc.09261.32</a>
</li>
<li>
<span class="authors">George Nemhauser, Mike Hewitt, and Martin Savelsbergh</span>
<span class="title">Using Branch-and-Price to Find High Quality Solutions Quickly</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.09261.33">10.4230/DagSemProc.09261.33</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