Dagstuhl Seminar Proceedings, Volume 5031,

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