default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Operations Research, Volume 1
Volume 1, Number 1, February 1984
- Roger J.-B. Wets:
Modeling and solution strategies for unconstrained stochastic optimization problems. 3-22 - Jan Karel Lenstra, A. H. G. Rinnooy Kan, Leen Stougie:
A framework for the probabilistic analysis of hierarchical planning systems. 23-42 - J. B. G. Frenk
, A. H. G. Rinnooy Kan, Leen Stougie:
A hierarchical scheduling problem with a well-solvable second stage. 43-58 - Gideon Weiss:
Stochastic bounds on distributions of optimal value functions with applications to pert, network flows and reliability. 59-65 - Bruno Apolloni, Ferdinando Pezzella:
Confidence intervals in the solution of stochastic integer linear programming problems. 67-78 - Sjur Didrik Flåm:
Optimal capacity in fisheries; A case where randomness is of minor importance. 79-83
Volume 1, Number 2, June 1984
- Francesco Archetti, Fabio Schoen:
A survey on the global optimization problem: General theory and computational approaches. 87-110 - Bruno Betrò, Renata Rotondi:
A Bayesian algorithm for global optimization. 111-128 - Antanas Zilinskas:
On justification of use of stochastic functions for multimodal optimization models. 129-134 - K. D. Patel:
Parallel computation and numerical optimisation. 135-149 - C. Sutti:
Local and global optimization by parallel algorithms for MIMD systems. 151-164 - Hans-Paul Schwefel:
Evolution strategies: A family of non-linear optimization techniques based on imitating some principles of organic evolution. 165-167
Volume 1, Number 3, October 1984
- Vasek Chvátal:
Probabilistic methods in graph theory. 171-182 - Colin McDiarmid:
Colouring random graphs. 183-200 - Dorit S. Hochbaum:
When are NP-hard location problems easy? 201-214 - Eitan Zemel:
Probabilistic analysis of geometric location problems. 215-238 - Gottfried Tinhofer:
A probabilistic analysis of some greedy cardinality matching algorithms. 239-254 - Carlo Vercellis:
A probabilistic analysis of the set covering problem. 255-271 - John Franco:
Probabilistic analysis of the pure literal heuristic for the satisfiability problem. 273-289 - F. Scarioni, M. Grazia Speranza:
The density function of the number of moves to complete the Towers of Hanoi puzzle. 291-303 - Michael L. Pinedo:
Optimal policies in stochastic shop scheduling. 305-329 - Francesco Maffioli, M. Grazia Speranza, Carlo Vercellis:
Randomized algorithms: An annotated bibliography - In alphabetical order. 331-345
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 2026-08-09 22:59 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
