default search action
Dagstuhl Seminar Proceedings: Algorithms for Optimization with Incomplete Information 2005
- Susanne Albers, Rolf H. Möhring, Georg Ch. Pflug, Rüdiger Schultz:
Algorithms for Optimization with Incomplete Information, 16.-21. January 2005. Dagstuhl Seminar Proceedings 05031, IBFI, Schloss Dagstuhl, Germany 2005 - Andreas S. Schulz:
New Old Algorithms for Stochastic Scheduling. - Han Hoogeveen, Marjan van den Akker:
Getting rid of stochasticity: applicable sometimes. - Sándor P. Fekete, Rolf Klein, Andreas Nüchter:
Searching with an Autonomous Robot. - Susanne Albers, Rolf H. Möhring, Georg Ch. Pflug, Rüdiger Schultz:
05031 Abstracts Collection - Algorithms for Optimization with Incomplete Information. - Peter Schütz, Leen Stougie, Asgeir Tomasgard:
Facility location with uncertain demand and economies of scale. - Nicole Megow, Marc Uetz, Tjark Vredeveld:
Models and Algorithms for Stochastic Online Scheduling. - René Henrion, Tamás Szántai:
Properties and Calculation of Singular Normal Distributions. - Ulrich Faigle, Alexander Schönhuth:
Note on Negative Probabilities and Observable Processes. - Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guido Schäfer, Tjark Vredeveld:
Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. - Leah Epstein, Rob van Stee:
Online scheduling of splittable tasks. - Maarten H. van der Vlerk:
Modification of Recourse Data for Mixed-Integer Recourse Models. - Chaitanya Swamy, David B. Shmoys
:
Approximation Algorithms for 2-stage and Multi-stage Stochastic Optimization. - Marc Christian Steinbach:
Tree-Sparse Modeling and Solution of Multistage Stochastic Programs. - Peter Sanders, Naveen Sivadasan, Martin Skutella:
Online Scheduling with Bounded Migration. - Jirí Sgall:
Online Scheduling. - Guido Schäfer, Naveen Sivadasan:
Topology Matters: Smoothed Competitiveness of Metrical Task Systems. - Yossi Azar, Yossi Richter:
An improved algorithm for CIOQ switches. - Jörg Rambau:
Deferment Control for Reoptimization -- How to Find Fair Reoptimized Dispatches. - Andy Philpott, Geoff Leyland:
Rowing to Barbados. - José Niño-Mora:
Marginal productivity index policies for scheduling restless bandits with switching penalties. - David P. Morton, Güzin Bayraksan:
Assessing Solution Quality in Stochastic Programs. - Jan Ehrhoff, Sven Grothklags, Ulf Lorenz:
Disruption Management and Planning with Uncertainties in Aircraft Planning. - Ronald Hochreiter:
Scenario Optimization for Multi-Stage Stochastic Programming Problems. - Hiroshi Fujiwara, Kazuo Iwama:
Average-Case Competitive Analyses for Ski-Rental Problems. - Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák, L. Shankar Ram:
Network Discovery and Verification. - Leah Epstein, Asaf Levin:
Tracking mobile users. - Susanne Albers, Rolf H. Möhring, Georg Ch. Pflug, Rüdiger Schultz:
05031 Summary-- Algorithms for Optimization with Incomplete Information. - Andreas Eichhorn, Werner Römisch, Isabel Wegner:
Polyhedral Risk Measures and Lagrangian Relaxation in Electricity Portfolio Optimization. - Shane Dye:
Subtree decomposition for multistage stochastic programs. - Fabian Bastin:
An adaptive trust-region approach for nonlinear stochastic optimisation with an application in discrete choice theory. - Jitka Dupacová:
Uncertainties in stochastic programming models: The minimax approach. - Vladimir I. Norkin, Boris Onischenko:
Minorant methods for stochastic global optimization.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-19 22:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: