default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Operations Research, Volume 30
Volume 30, Number 1, 1991
- Aharon Ben-Tal, Adi Ben-Israel:
A recourse certainty equivalent for decisions under uncertainty. 1-44 - Patrick H. McAllister:
Adaptive approaches to stochastic programming. 45-62 - Ron S. Dembo:
Scenario optimization. 63-80 - Andrey I. Kibzun, V. Yu. Kurbakovskiy:
Guaranteeing approach to solving quantile optimization problems. 81-93 - Tomás Cipra
:
Stochastic programming with random processes. 95-105 - Raj Jagannathan:
Linear programming with stochastic processes as parameters as applied to production planning. 107-114 - A. Truffert:
Conditional expectation of integrands and random sets. 115-156 - Gabriella Salinetti, Roger J.-B. Wets:
Glivenko-Cantelli type theorems: An application of the convergence theory of stochastic suprema. 157-168 - Alexander Shapiro:
Asymptotic analysis of stochastic programs. 169-186 - Yuri M. Ermoliev, Vladimir I. Norkin:
Normalized convergence in stochastic optimization. 187-198 - Jitka Dupacová:
On statistical sensitivity analysis in stochastic programming. 199-214 - Julia L. Higle, Suvrajeet Sen:
Statistical verification of optimality conditions for stochastic programs with recourse. 215-239 - Werner Römisch, Rüdiger Schultz:
Stability analysis for stochastic programs. 241-266 - Peter Kall:
An upper bound for SLP using first and total second moments. 267-276 - John R. Birge, José H. Dulá:
Bounding separable recourse functions with limited distribution information. 277-298 - Kevin D. Glazebrook, Richard J. Boys, N. A. Fay:
On the evaluation of strategies for branching bandit processes. 299-319
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-09-05 00:35 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.
