The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
On Complexity of Stochastic Programming Problems
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Artzner, P., Delbaen, F., Eber, J., & Heath, D. (1999) · Mathematical Finance · doi:10.1111/1467-9965.00068 · Cited by 8,806
Large Deviations Techniques and Applications
Schmock, U., Dembo, A., & Zeitouni, O. (2000) · Journal of the American Statistical Association · doi:10.2307/2669805 · Cited by 3,524
Large Deviations Techniques and Applications
Dembo, A., & Zeitouni, O. (1998) · Springer eBooks · doi:10.1007/978-1-4612-5320-4 · Cited by 3,019
Chance-Constrained Programming
Charnes, A., & Cooper, W. W. (1959) · Management Science · doi:10.1287/mnsc.6.1.73 · Cited by 2,742
The complexity of computing the permanent
Valiant, L. G. (1979) · Theoretical Computer Science · doi:10.1016/0304-3975(79)90044-6 · Cited by 2,705
Ben-Tal, A., & Nemirovski, A. (1998) · Mathematics of Operations Research · doi:10.1287/moor.23.4.769 · Cited by 2,598
Self-citationStochastic Programming: The State of the Art In Honor of George B. Dantzig
(2010) · International series in management science/operations research/International series in operations research & management science · doi:10.1007/978-1-4419-1642-6 · Cited by 2,239
The Sample Average Approximation Method for Stochastic Discrete Optimization
Kleywegt, A. J., Shapiro, A., & Homem-de-Mello, T. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623499363220 · Cited by 1,983
Self-citationPrékopa, A. (1995) · Springer eBooks · doi:10.1007/978-94-017-3087-7 · Cited by 1,535
Journal of the Royal Statistical Society.
(1921) · The Economic Journal · doi:10.1093/ej/31.121.133 · Cited by 1,465
Cited by
From Predictive to Prescriptive Analytics
Bertsimas, D., & Kallus, N. (2020) · Management Science · doi:10.1287/mnsc.2018.3253 · Cited by 784
Distributionally Robust Optimization and Its Tractable Approximations
Goh, J., & Sim, M. (2010) · Operations Research · doi:10.1287/opre.1090.0795 · Cited by 668
An optimal method for stochastic composite optimization
Lan, G. (2012) · Mathematical Programming · doi:10.1007/s10107-010-0434-y · Cited by 427
Adaptive Distributionally Robust Optimization
Bertsimas, D., Sim, M., & Zhang, M. (2019) · Management Science · doi:10.1287/mnsc.2017.2952 · Cited by 326
From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization
Chen, W., Sim, M., Sun, J., & Teo, C.-P. (2010) · Operations Research · doi:10.1287/opre.1090.0712 · Cited by 318
Metadata
- Authors
- Shapiro, A., & Nemirovski, A.
- Venue
- Applied Optimization
- Publisher
- Springer-Verlag
- Published
- 2006-02-10
- Pages
- 111-146
- OpenAlex
- W2142092335
- Cited by
- 301
- References
- 38
- FWCI
- 30.49
- Type
- book chapter
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On Complexity of Stochastic Programming Problems. https://app.cochat.ai/papers/10.1007/0-387-26771-9_4
- The paper
- Shapiro, A., & Nemirovski, A. (2006). On Complexity of Stochastic Programming Problems. Applied Optimization. https://doi.org/10.1007/0-387-26771-9_4
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
