@InProceedings{albers_et_al:DagSemProc.05031.1,
author = {Albers, Susanne and M\"{o}hring, Rolf H. and Pflug, Georg Ch. and Schultz, R\"{u}diger},
title = {{05031 Abstracts Collection – Algorithms for Optimization with Incomplete Information}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {1--25},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.1},
URN = {urn:nbn:de:0030-drops-1948},
doi = {10.4230/DagSemProc.05031.1},
annote = {Keywords: Online optimization , robust optimization , stochastic programming , stochastic scheduling}
}
@InProceedings{albers_et_al:DagSemProc.05031.2,
author = {Albers, Susanne and M\"{o}hring, Rolf H. and Pflug, Georg Ch. and Schultz, R\"{u}diger},
title = {{05031 Summary – Algorithms for Optimization with Incomplete Information}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {1--2},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.2},
URN = {urn:nbn:de:0030-drops-1138},
doi = {10.4230/DagSemProc.05031.2},
annote = {Keywords: Online Optimization , Robust Optimization , Stochastic Programming , Stochastic Scheduling}
}
@InProceedings{bastin:DagSemProc.05031.3,
author = {Bastin, Fabian},
title = {{An adaptive trust-region approach for nonlinear stochastic optimisation with an application in discrete choice theory}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {1--4},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.3},
URN = {urn:nbn:de:0030-drops-559},
doi = {10.4230/DagSemProc.05031.3},
annote = {Keywords: Nonlinear Stochastic Programming , Monte-Carlo , Mixed Logit , Discrete Choice , Trust-Region}
}
@InProceedings{azar_et_al:DagSemProc.05031.4,
author = {Azar, Yossi and Richter, Yossi},
title = {{An improved algorithm for CIOQ switches}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {1--4},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.4},
URN = {urn:nbn:de:0030-drops-670},
doi = {10.4230/DagSemProc.05031.4},
annote = {Keywords: On-line algorithms, Competitive ratio, CIOQ Switch, Packet Switching, Buffer Management, Quality of Service.}
}
@InProceedings{swamy_et_al:DagSemProc.05031.5,
author = {Swamy, Chaitanya and Shmoys, David},
title = {{Approximation Algorithms for 2-stage and Multi-stage Stochastic Optimization}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {1--5},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.5},
URN = {urn:nbn:de:0030-drops-723},
doi = {10.4230/DagSemProc.05031.5},
annote = {Keywords: Algorithms, Approximation Algorithms, Optimization, Convex Optimization, Stochastic Optimization}
}
@InProceedings{morton_et_al:DagSemProc.05031.6,
author = {Morton, David P. and Bayraksan, Guzin},
title = {{Assessing Solution Quality in Stochastic Programs}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {1--3},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.6},
URN = {urn:nbn:de:0030-drops-638},
doi = {10.4230/DagSemProc.05031.6},
annote = {Keywords: stochastic programming , Monte Carlo simulation}
}
@InProceedings{becchetti_et_al:DagSemProc.05031.7,
author = {Becchetti, Luca and Leonardi, Stefano and Marchetti-Spaccamela, Alberto and Schaefer, Guidouca and Vredeveld, Tjark},
title = {{Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {5--28},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.7},
URN = {urn:nbn:de:0030-drops-752},
doi = {10.4230/DagSemProc.05031.7},
annote = {Keywords: Competitive analysis , average case analysis , smoothed analysis , scheduling}
}
@InProceedings{fujiwara_et_al:DagSemProc.05031.8,
author = {Fujiwara, Hiroshi and Iwama, Kazuo},
title = {{Average-Case Competitive Analyses for Ski-Rental Problems}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {1--3},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.8},
URN = {urn:nbn:de:0030-drops-606},
doi = {10.4230/DagSemProc.05031.8},
annote = {Keywords: online algorithm , competitive analysis}
}
@InProceedings{rambau:DagSemProc.05031.9,
author = {Rambau, J\"{o}rg},
title = {{Deferment Control for Reoptimization – How to Find Fair Reoptimized Dispatches}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {1--4},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.9},
URN = {urn:nbn:de:0030-drops-668},
doi = {10.4230/DagSemProc.05031.9},
annote = {Keywords: online optimization , dynamic vehicle dispatching , reoptimization , integer linear program , dynamic column generation , infinite deferment ,}
}
@InProceedings{ehrhoff_et_al:DagSemProc.05031.10,
author = {Ehrhoff, Jan and Grothklags, Sven and Lorenz, Ulf},
title = {{Disruption Management and Planning with Uncertainties in Aircraft Planning}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {1--5},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.10},
URN = {urn:nbn:de:0030-drops-620},
doi = {10.4230/DagSemProc.05031.10},
annote = {Keywords: uncertainty, planning, game playing, aviation application}
}
@InProceedings{schutz_et_al:DagSemProc.05031.11,
author = {Sch\"{u}tz, Peter and Stougie, Leen and Tomasgard, Asgeir},
title = {{Facility location with uncertain demand and economies of scale}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {1--11},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.11},
URN = {urn:nbn:de:0030-drops-1114},
doi = {10.4230/DagSemProc.05031.11},
annote = {Keywords: facility location , stochastic , economies of scale}
}
@InProceedings{hoogeveen_et_al:DagSemProc.05031.12,
author = {Hoogeveen, Han and Van den Akker, Marjan},
title = {{Getting rid of stochasticity: applicable sometimes}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {1--4},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.12},
URN = {urn:nbn:de:0030-drops-1924},
doi = {10.4230/DagSemProc.05031.12},
annote = {Keywords: Scheduling , sequencing , single machine , number of late jobs , stochastic processing times , minimum success probability , dynamic programming unreliable machines}
}
@InProceedings{ninomora:DagSemProc.05031.13,
author = {Ni\~{n}o-Mora, Jos\'{e}},
title = {{Marginal productivity index policies for scheduling restless bandits with switching penalties}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {1--6},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.13},
URN = {urn:nbn:de:0030-drops-644},
doi = {10.4230/DagSemProc.05031.13},
annote = {Keywords: stochastic scheduling , restless bandits , index policies , switching penalties}
}
@InProceedings{norkin_et_al:DagSemProc.05031.14,
author = {Norkin, Vladimir and Onischenko, Boris.},
title = {{Minorant methods for stochastic global optimization}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {1--9},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.14},
URN = {urn:nbn:de:0030-drops-2115},
doi = {10.4230/DagSemProc.05031.14},
annote = {Keywords: Stochastic global optimization, stochastic tangent minorant, branch and bound method}
}
@InProceedings{megow_et_al:DagSemProc.05031.15,
author = {Megow, Nicole and Uetz, Marc and Vredeveld, Tjark},
title = {{Models and Algorithms for Stochastic Online Scheduling}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {1--4},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.15},
URN = {urn:nbn:de:0030-drops-1106},
doi = {10.4230/DagSemProc.05031.15},
annote = {Keywords: stochastic scheduling , online optimization , weighted completion time}
}
@InProceedings{vlerk:DagSemProc.05031.16,
author = {Vlerk, Maarten H. van der},
title = {{Modification of Recourse Data for Mixed-Integer Recourse Models}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {1--3},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.16},
URN = {urn:nbn:de:0030-drops-738},
doi = {10.4230/DagSemProc.05031.16},
annote = {Keywords: stochastic programming, integer programming, approximation}
}
@InProceedings{beerliova_et_al:DagSemProc.05031.17,
author = {Beerliova, Zuzana and Eberhard, Felix and Erlebach, Thomas and Hall, Alexander and Hoffmann, Michael and Mihalak, Matus and Ram, L. Shankar},
title = {{Network Discovery and Verification}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {1--4},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.17},
URN = {urn:nbn:de:0030-drops-594},
doi = {10.4230/DagSemProc.05031.17},
annote = {Keywords: on-line algorithms , set cover , landmarks , metric dimension}
}
@InProceedings{schulz:DagSemProc.05031.18,
author = {Schulz, Andreas S.},
title = {{New Old Algorithms for Stochastic Scheduling}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {1--9},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.18},
URN = {urn:nbn:de:0030-drops-1931},
doi = {10.4230/DagSemProc.05031.18},
annote = {Keywords: stochastic scheduling , online algorithms , competitive analysis , approximation algorithms , linear programming relaxations}
}
@InProceedings{faigle_et_al:DagSemProc.05031.19,
author = {Faigle, Ulrich and Schoenhuth, Alexander},
title = {{Note on Negative Probabilities and Observable Processes}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {1--14},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.19},
URN = {urn:nbn:de:0030-drops-1087},
doi = {10.4230/DagSemProc.05031.19},
annote = {Keywords: Negative Probability , Observable Process , Markov Chain , Stochastic Process , Bell\~{A}¢\^{a}‚¬\^{a}„¢s Inequality , HHM , LDP , OOM}
}
@InProceedings{sgall:DagSemProc.05031.20,
author = {Sgall, Jiri},
title = {{Online Scheduling}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {1--3},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.20},
URN = {urn:nbn:de:0030-drops-695},
doi = {10.4230/DagSemProc.05031.20},
annote = {Keywords: online algorithms , scheduling}
}
@InProceedings{epstein_et_al:DagSemProc.05031.21,
author = {Epstein, Leah and Stee, Rob van},
title = {{Online scheduling of splittable tasks}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {1--3},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.21},
URN = {urn:nbn:de:0030-drops-743},
doi = {10.4230/DagSemProc.05031.21},
annote = {Keywords: online scheduling , splittable tasks , parallel machines , greedy algorithm}
}
@InProceedings{sanders_et_al:DagSemProc.05031.22,
author = {Sanders, Peter and Sivadasan, Naveen and Skutella, Martin},
title = {{Online Scheduling with Bounded Migration}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {1--3},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.22},
URN = {urn:nbn:de:0030-drops-707},
doi = {10.4230/DagSemProc.05031.22},
annote = {Keywords: scheduling, sensitivity analysis, online algorithm}
}
@InProceedings{eichhorn_et_al:DagSemProc.05031.23,
author = {Eichhorn, Andreas and R\"{o}misch, Werner and Wegner, Isabel},
title = {{Polyhedral Risk Measures and Lagrangian Relaxation in Electricity Portfolio Optimization}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {1--3},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.23},
URN = {urn:nbn:de:0030-drops-574},
doi = {10.4230/DagSemProc.05031.23},
annote = {Keywords: Stochastic Programming , Mean-Risk Optimization , Risk Measure , Lagrangian Relaxation , Electricity;}
}
@InProceedings{henrion_et_al:DagSemProc.05031.24,
author = {Henrion, Ren\'{e} and Szantai, Tamas},
title = {{Properties and Calculation of Singular Normal Distributions}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {1--2},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.24},
URN = {urn:nbn:de:0030-drops-1097},
doi = {10.4230/DagSemProc.05031.24},
annote = {Keywords: singular normal distribution , chance constraints , normal probability of polyhedra}
}
@InProceedings{philpott_et_al:DagSemProc.05031.25,
author = {Philpott, Andy and Leyland, Geoff},
title = {{Rowing to Barbados}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {1--6},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.25},
URN = {urn:nbn:de:0030-drops-656},
doi = {10.4230/DagSemProc.05031.25},
annote = {Keywords: ocean rowing , weather routing , dynamic programming , isochrones}
}
@InProceedings{hochreiter:DagSemProc.05031.26,
author = {Hochreiter, Ronald},
title = {{Scenario Optimization for Multi-Stage Stochastic Programming Problems}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {1--3},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.26},
URN = {urn:nbn:de:0030-drops-614},
doi = {10.4230/DagSemProc.05031.26},
annote = {Keywords: Stochastic programming, scenario generation, facility location, financial engineering}
}
@InProceedings{fekete_et_al:DagSemProc.05031.27,
author = {Fekete, S\'{a}ndor and Klein, Rolf and N\"{u}chter, Andreas},
title = {{Searching with an Autonomous Robot}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {1--2},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.27},
URN = {urn:nbn:de:0030-drops-1919},
doi = {10.4230/DagSemProc.05031.27},
annote = {Keywords: Searching , visibility problems , watchman problems , online searching , competitive strategies , autonomous mobile robots three-dimensional laser scanning , Kurt3D}
}
@InProceedings{dye:DagSemProc.05031.28,
author = {Dye, Shane},
title = {{Subtree decomposition for multistage stochastic programs}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {1--3},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.28},
URN = {urn:nbn:de:0030-drops-562},
doi = {10.4230/DagSemProc.05031.28},
annote = {Keywords: Stochastic programming , scenario tree , decomposition}
}
@InProceedings{schafer_et_al:DagSemProc.05031.29,
author = {Sch\"{a}fer, Guido and Sivadasan, Naveen},
title = {{Topology Matters: Smoothed Competitiveness of Metrical Task Systems}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {1--5},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.29},
URN = {urn:nbn:de:0030-drops-684},
doi = {10.4230/DagSemProc.05031.29},
annote = {Keywords: online algorithm, metrical task systems, work function algorithm, smoothed competitive analysis}
}
@InProceedings{epstein_et_al:DagSemProc.05031.30,
author = {Epstein, Leah and Levin, Asaf},
title = {{Tracking mobile users}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {1--3},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.30},
URN = {urn:nbn:de:0030-drops-580},
doi = {10.4230/DagSemProc.05031.30},
annote = {Keywords: mobile users , PTAS}
}
@InProceedings{steinbach:DagSemProc.05031.31,
author = {Steinbach, Marc},
title = {{Tree-Sparse Modeling and Solution of Multistage Stochastic Programs}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {1--3},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.31},
URN = {urn:nbn:de:0030-drops-714},
doi = {10.4230/DagSemProc.05031.31},
annote = {Keywords: Tree-sparse programs, multistage stochastic optimization, KKT systems, hierarchical sparsity}
}
@InProceedings{dupacova:DagSemProc.05031.32,
author = {Dupacov\'{a}, Jitka},
title = {{Uncertainties in stochastic programming models: The minimax approach}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {1--2},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.32},
URN = {urn:nbn:de:0030-drops-452},
doi = {10.4230/DagSemProc.05031.32},
annote = {Keywords: stochastic programming models , minimax approach}
}
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