Published in: Dagstuhl Seminar Proceedings, Volume 5031, Algorithms for Optimization with Incomplete Information (2005)
Vladimir Norkin and Boris. Onischenko. Minorant methods for stochastic global optimization. In Algorithms for Optimization with Incomplete Information. Dagstuhl Seminar Proceedings, Volume 5031, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@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-dev.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} }
Published in: Dagstuhl Seminar Proceedings, Volume 5031, Algorithms for Optimization with Incomplete Information (2005)
Susanne Albers, Rolf H. Möhring, Georg Ch. Pflug, and Rüdiger Schultz. 05031 Abstracts Collection – Algorithms for Optimization with Incomplete Information. In Algorithms for Optimization with Incomplete Information. Dagstuhl Seminar Proceedings, Volume 5031, pp. 1-25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@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-dev.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} }
Published in: Dagstuhl Seminar Proceedings, Volume 5031, Algorithms for Optimization with Incomplete Information (2005)
Han Hoogeveen and Marjan Van den Akker. Getting rid of stochasticity: applicable sometimes. In Algorithms for Optimization with Incomplete Information. Dagstuhl Seminar Proceedings, Volume 5031, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@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-dev.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} }
Published in: Dagstuhl Seminar Proceedings, Volume 5031, Algorithms for Optimization with Incomplete Information (2005)
Andreas S. Schulz. New Old Algorithms for Stochastic Scheduling. In Algorithms for Optimization with Incomplete Information. Dagstuhl Seminar Proceedings, Volume 5031, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@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-dev.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} }
Published in: Dagstuhl Seminar Proceedings, Volume 5031, Algorithms for Optimization with Incomplete Information (2005)
Sándor Fekete, Rolf Klein, and Andreas Nüchter. Searching with an Autonomous Robot. In Algorithms for Optimization with Incomplete Information. Dagstuhl Seminar Proceedings, Volume 5031, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@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-dev.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} }
Published in: Dagstuhl Seminar Proceedings, Volume 5031, Algorithms for Optimization with Incomplete Information (2005)
Peter Schütz, Leen Stougie, and Asgeir Tomasgard. Facility location with uncertain demand and economies of scale. In Algorithms for Optimization with Incomplete Information. Dagstuhl Seminar Proceedings, Volume 5031, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@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-dev.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} }
Published in: Dagstuhl Seminar Proceedings, Volume 5031, Algorithms for Optimization with Incomplete Information (2005)
Nicole Megow, Marc Uetz, and Tjark Vredeveld. Models and Algorithms for Stochastic Online Scheduling. In Algorithms for Optimization with Incomplete Information. Dagstuhl Seminar Proceedings, Volume 5031, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@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-dev.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} }
Published in: Dagstuhl Seminar Proceedings, Volume 5031, Algorithms for Optimization with Incomplete Information (2005)
Ulrich Faigle and Alexander Schoenhuth. Note on Negative Probabilities and Observable Processes. In Algorithms for Optimization with Incomplete Information. Dagstuhl Seminar Proceedings, Volume 5031, pp. 1-14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@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-dev.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} }
Published in: Dagstuhl Seminar Proceedings, Volume 5031, Algorithms for Optimization with Incomplete Information (2005)
René Henrion and Tamas Szantai. Properties and Calculation of Singular Normal Distributions. In Algorithms for Optimization with Incomplete Information. Dagstuhl Seminar Proceedings, Volume 5031, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@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-dev.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} }
Published in: Dagstuhl Seminar Proceedings, Volume 5031, Algorithms for Optimization with Incomplete Information (2005)
Yossi Azar and Yossi Richter. An improved algorithm for CIOQ switches. In Algorithms for Optimization with Incomplete Information. Dagstuhl Seminar Proceedings, Volume 5031, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@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-dev.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.} }
Published in: Dagstuhl Seminar Proceedings, Volume 5031, Algorithms for Optimization with Incomplete Information (2005)
Chaitanya Swamy and David Shmoys. Approximation Algorithms for 2-stage and Multi-stage Stochastic Optimization. In Algorithms for Optimization with Incomplete Information. Dagstuhl Seminar Proceedings, Volume 5031, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@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-dev.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} }
Published in: Dagstuhl Seminar Proceedings, Volume 5031, Algorithms for Optimization with Incomplete Information (2005)
David P. Morton and Guzin Bayraksan. Assessing Solution Quality in Stochastic Programs. In Algorithms for Optimization with Incomplete Information. Dagstuhl Seminar Proceedings, Volume 5031, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@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-dev.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} }
Published in: Dagstuhl Seminar Proceedings, Volume 5031, Algorithms for Optimization with Incomplete Information (2005)
Luca Becchetti, Stefano Leonardi, Alberto Marchetti-Spaccamela, Guidouca Schaefer, and Tjark Vredeveld. Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm. In Algorithms for Optimization with Incomplete Information. Dagstuhl Seminar Proceedings, Volume 5031, pp. 5-28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@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-dev.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} }
Published in: Dagstuhl Seminar Proceedings, Volume 5031, Algorithms for Optimization with Incomplete Information (2005)
Hiroshi Fujiwara and Kazuo Iwama. Average-Case Competitive Analyses for Ski-Rental Problems. In Algorithms for Optimization with Incomplete Information. Dagstuhl Seminar Proceedings, Volume 5031, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@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-dev.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} }
Published in: Dagstuhl Seminar Proceedings, Volume 5031, Algorithms for Optimization with Incomplete Information (2005)
Jörg Rambau. Deferment Control for Reoptimization – How to Find Fair Reoptimized Dispatches. In Algorithms for Optimization with Incomplete Information. Dagstuhl Seminar Proceedings, Volume 5031, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@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-dev.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 ,} }
Feedback for Dagstuhl Publishing