<h2>Dagstuhl Seminar Proceedings, Volume 5031, </h2>
<ul>
<li>
<span class="authors">Susanne Albers, Rolf H. Möhring, Georg Ch. Pflug, and Rüdiger Schultz</span>
<span class="title">05031 Abstracts Collection – Algorithms for Optimization with Incomplete Information</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.05031.1">10.4230/DagSemProc.05031.1</a>
</li>
<li>
<span class="authors">Susanne Albers, Rolf H. Möhring, Georg Ch. Pflug, and Rüdiger Schultz</span>
<span class="title">05031 Summary – Algorithms for Optimization with Incomplete Information</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.05031.2">10.4230/DagSemProc.05031.2</a>
</li>
<li>
<span class="authors">Fabian Bastin</span>
<span class="title">An adaptive trust-region approach for nonlinear stochastic optimisation with an application in discrete choice theory</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.05031.3">10.4230/DagSemProc.05031.3</a>
</li>
<li>
<span class="authors">Yossi Azar and Yossi Richter</span>
<span class="title">An improved algorithm for CIOQ switches</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.05031.4">10.4230/DagSemProc.05031.4</a>
</li>
<li>
<span class="authors">Chaitanya Swamy and David Shmoys</span>
<span class="title">Approximation Algorithms for 2-stage and Multi-stage Stochastic Optimization</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.05031.5">10.4230/DagSemProc.05031.5</a>
</li>
<li>
<span class="authors">David P. Morton and Guzin Bayraksan</span>
<span class="title">Assessing Solution Quality in Stochastic Programs</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.05031.6">10.4230/DagSemProc.05031.6</a>
</li>
<li>
<span class="authors">Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guidouca Schaefer, and Tjark Vredeveld</span>
<span class="title">Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.05031.7">10.4230/DagSemProc.05031.7</a>
</li>
<li>
<span class="authors">Hiroshi Fujiwara and Kazuo Iwama</span>
<span class="title">Average-Case Competitive Analyses for Ski-Rental Problems</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.05031.8">10.4230/DagSemProc.05031.8</a>
</li>
<li>
<span class="authors">Jörg Rambau</span>
<span class="title">Deferment Control for Reoptimization – How to Find Fair Reoptimized Dispatches</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.05031.9">10.4230/DagSemProc.05031.9</a>
</li>
<li>
<span class="authors">Jan Ehrhoff, Sven Grothklags, and Ulf Lorenz</span>
<span class="title">Disruption Management and Planning with Uncertainties in Aircraft Planning</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.05031.10">10.4230/DagSemProc.05031.10</a>
</li>
<li>
<span class="authors">Peter Schütz, Leen Stougie, and Asgeir Tomasgard</span>
<span class="title">Facility location with uncertain demand and economies of scale</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.05031.11">10.4230/DagSemProc.05031.11</a>
</li>
<li>
<span class="authors">Han Hoogeveen and Marjan Van den Akker</span>
<span class="title">Getting rid of stochasticity: applicable sometimes</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.05031.12">10.4230/DagSemProc.05031.12</a>
</li>
<li>
<span class="authors">José Niño-Mora</span>
<span class="title">Marginal productivity index policies for scheduling restless bandits with switching penalties</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.05031.13">10.4230/DagSemProc.05031.13</a>
</li>
<li>
<span class="authors">Vladimir Norkin and Boris. Onischenko</span>
<span class="title">Minorant methods for stochastic global optimization</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.05031.14">10.4230/DagSemProc.05031.14</a>
</li>
<li>
<span class="authors">Nicole Megow, Marc Uetz, and Tjark Vredeveld</span>
<span class="title">Models and Algorithms for Stochastic Online Scheduling</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.05031.15">10.4230/DagSemProc.05031.15</a>
</li>
<li>
<span class="authors">Maarten H. van der Vlerk</span>
<span class="title">Modification of Recourse Data for Mixed-Integer Recourse Models</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.05031.16">10.4230/DagSemProc.05031.16</a>
</li>
<li>
<span class="authors">Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matus Mihalak, and L. Shankar Ram</span>
<span class="title">Network Discovery and Verification</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.05031.17">10.4230/DagSemProc.05031.17</a>
</li>
<li>
<span class="authors">Andreas S. Schulz</span>
<span class="title">New Old Algorithms for Stochastic Scheduling</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.05031.18">10.4230/DagSemProc.05031.18</a>
</li>
<li>
<span class="authors">Ulrich Faigle and Alexander Schoenhuth</span>
<span class="title">Note on Negative Probabilities and Observable Processes</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.05031.19">10.4230/DagSemProc.05031.19</a>
</li>
<li>
<span class="authors">Jiri Sgall</span>
<span class="title">Online Scheduling</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.05031.20">10.4230/DagSemProc.05031.20</a>
</li>
<li>
<span class="authors">Leah Epstein and Rob van Stee</span>
<span class="title">Online scheduling of splittable tasks</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.05031.21">10.4230/DagSemProc.05031.21</a>
</li>
<li>
<span class="authors">Peter Sanders, Naveen Sivadasan, and Martin Skutella</span>
<span class="title">Online Scheduling with Bounded Migration</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.05031.22">10.4230/DagSemProc.05031.22</a>
</li>
<li>
<span class="authors">Andreas Eichhorn, Werner Römisch, and Isabel Wegner</span>
<span class="title">Polyhedral Risk Measures and Lagrangian Relaxation in Electricity Portfolio Optimization</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.05031.23">10.4230/DagSemProc.05031.23</a>
</li>
<li>
<span class="authors">René Henrion and Tamas Szantai</span>
<span class="title">Properties and Calculation of Singular Normal Distributions</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.05031.24">10.4230/DagSemProc.05031.24</a>
</li>
<li>
<span class="authors">Andy Philpott and Geoff Leyland</span>
<span class="title">Rowing to Barbados</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.05031.25">10.4230/DagSemProc.05031.25</a>
</li>
<li>
<span class="authors">Ronald Hochreiter</span>
<span class="title">Scenario Optimization for Multi-Stage Stochastic Programming Problems</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.05031.26">10.4230/DagSemProc.05031.26</a>
</li>
<li>
<span class="authors">Sándor Fekete, Rolf Klein, and Andreas Nüchter</span>
<span class="title">Searching with an Autonomous Robot</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.05031.27">10.4230/DagSemProc.05031.27</a>
</li>
<li>
<span class="authors">Shane Dye</span>
<span class="title">Subtree decomposition for multistage stochastic programs</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.05031.28">10.4230/DagSemProc.05031.28</a>
</li>
<li>
<span class="authors">Guido Schäfer and Naveen Sivadasan</span>
<span class="title">Topology Matters: Smoothed Competitiveness of Metrical Task Systems</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.05031.29">10.4230/DagSemProc.05031.29</a>
</li>
<li>
<span class="authors">Leah Epstein and Asaf Levin</span>
<span class="title">Tracking mobile users</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.05031.30">10.4230/DagSemProc.05031.30</a>
</li>
<li>
<span class="authors">Marc Steinbach</span>
<span class="title">Tree-Sparse Modeling and Solution of Multistage Stochastic Programs</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.05031.31">10.4230/DagSemProc.05031.31</a>
</li>
<li>
<span class="authors">Jitka Dupacová</span>
<span class="title">Uncertainties in stochastic programming models: The minimax approach</span>
<a class="doi" href="https://doi.org/10.4230/DagSemProc.05031.32">10.4230/DagSemProc.05031.32</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