On Complexity of Stochastic Programming Problems
The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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 · cited 1×
“The latter problem is known to be really difficult. First of all, it is NP-hard, [ Val79 ].”
BackgroundBen-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
Convex measures of risk and trading constraints
Föllmer, H., & Schied, A. (2002) · Finance and Stochastics · doi:10.1007/s007800200072 · Cited by 1,447
Adjustable robust solutions of uncertain linear programs
Ben-Tal, A., Goryashko, A., Guslitzer, E., & Nemirovski, A. (2004) · Mathematical Programming · doi:10.1007/s10107-003-0454-y · Cited by 1,380
Self-citationLinear Programming under Uncertainty
Dantzig, G. B. (1955) · Management Science · doi:10.1287/mnsc.1.3-4.197 · Cited by 1,225
Linear Programming Under Uncertainty
Dantzig, G. B. (2004) · Management Science · doi:10.1287/mnsc.1040.0261 · Cited by 1,173
A stochastic programming approach for supply chain network design under uncertainty
Santoso, T., Ahmed, S., Goetschalckx, M., & Shapiro, A. (2005) · European Journal of Operational Research · doi:10.1016/j.ejor.2004.01.046 · Cited by 1,131
Self-citationShapiro, A. (2003) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(03)10006-0 · Cited by 916 · cited 1×
“guarantees that probability of the event {Sf^ C S^} is at least 1 — a (see [KSH01],[ Sha03b , section 3.1]).”
BackgroundInfluentialSelf-citationAdjustable robust solutions of uncertain linear programs
Ben-TalA., GoryashkoA., GuslitzerE., et al. (2004) · Mathematical Programming · doi:10.5555/2990016.3114320 · Cited by 849
Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications
Ben-Tal, A., & Nemirovski, A. (2001) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718829 · Cited by 747
Self-citationMonte Carlo bounding techniques for determining solution quality in stochastic programs
Mak, W.-K., Morton, D. P., & Wood, R. K. (1999) · Operations Research Letters · doi:10.1016/s0167-6377(98)00054-6 · Cited by 704
Uncertain convex programs: randomized solutions and confidence levels
Calafiore, G., & Campi, M. C. (2005) · Mathematical Programming · doi:10.1007/s10107-003-0499-y · Cited by 659
On Minimizing a Convex Function Subject to Linear Inequalities
Beale, E. M. L. (1955) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1955.tb00191.x · Cited by 625
Verweij, B., Ahmed, S., Kleywegt, A. J., Nemhauser, G. L., & Shapiro, A. (2003) · Computational Optimization and Applications · doi:10.1023/a:1021814225969 · Cited by 568
Self-citationThe empirical behavior of sampling methods for stochastic programming
Linderoth, J., Shapiro, A., & Wright, S. (2006) · Annals of Operations Research · doi:10.1007/s10479-006-6169-8 · Cited by 425
Self-citationRetailer-Supplier Flexible Commitments Contracts: A Robust Optimization Approach
Ben-Tal, A., Golany, B., Nemirovski, A., & Vial, J.-P. (2005) · Manufacturing & Service Operations Management · doi:10.1287/msom.1050.0081 · Cited by 322
Self-citationOn the Rate of Convergence of Optimal Solutions of Monte Carlo Approximations of Stochastic Programs
Shapiro, A., & Homem‐de‐Mello, T. (2000) · SIAM Journal on Optimization · doi:10.1137/s1052623498349541 · Cited by 250
Self-citationProbabilistic and Randomized Methods for Design under Uncertainty
(2006) · Springer eBooks · doi:10.1007/b138725 · Cited by 212
The uniform distribution: A rigorous justification for its use in robustness analysis
Barmish, B. R., & Lagoa, C. M. (1997) · Mathematics of Control Signals and Systems · doi:10.1007/bf01211503 · Cited by 207
Deviation Measures in Risk Analysis and Optimization
Rockafellar, T. R., Uryasev, S. P., & Zabarankin, M. (2003) · SSRN Electronic Journal · doi:10.2139/ssrn.365640 · Cited by 187
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents
Linial, N., Samorodnitsky, A., & Wigderson, A. (2000) · COMBINATORICA · doi:10.1007/s004930070007 · Cited by 169
On complexity of multistage stochastic programs
Shapiro, A. (2006) · Operations Research Letters · doi:10.1016/j.orl.2005.02.003 · Cited by 165
Self-citationOn minimax solutions of stochastic linear programming problems
Žáčková, J. (1966) · Časopis pro pěstování matematiky · doi:10.21136/cpm.1966.117583 · Cited by 158
The minimax approach to stochastic programming and an illustrative application
Dupačová, J. (1987) · Stochastics · doi:10.1080/17442508708833436 · Cited by 154
Landau, H. J. (1987) · Proceedings of symposia in applied mathematics · doi:10.1090/psapm/037 · Cited by 103
Conditioning of convex piecewise linear stochastic programs
Shapiro, A., Homem‐de‐Mello, T., & Kim, J. (2002) · Mathematical Programming · doi:10.1007/s10107-002-0313-2 · Cited by 80
Self-citationPolytopes, permanents and graphs with large factors
Dagum, P., Luby, M. G., Mihail, M., & Vazirani, U. V. (1988) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1988.21957 · Cited by 67
On rate of convergence of Monte Carlo approximations of stochastic programs
Shapiro, A., & Homem‐de‐Mello, T. (1998) · Cited by 60
Self-citationA Mildly Exponential Approximation Algorithm for the Permanent
Jerrum, M., & Vazirani, U. V. (1996) · Algorithmica · doi:10.1007/bf01940871 · Cited by 37
Worst-case distribution analysis of stochastic programs
Shapiro, A. (2005) · Mathematical Programming · doi:10.1007/s10107-005-0680-6 · Cited by 29
Self-citation
Cited by
From Predictive to Prescriptive Analytics
Bertsimas, D., & Kallus, N. (2020) · Management Science · doi:10.1287/mnsc.2018.3253 · Cited by 784
From Predictive to Prescriptive Analytics
Bertsimas, D., & Kallus, N. (2014) · arXiv · doi:10.48550/arxiv.1402.5481 · Cited by 783
Distributionally Robust Optimization and Its Tractable Approximations
Goh, J., & Sim, M. (2010) · Operations Research · doi:10.1287/opre.1090.0795 · Cited by 668
Frameworks and Results in Distributionally Robust Optimization
Rahimian, H., & Mehrotra, S. (2022) · Open Journal of Mathematical Optimization · doi:10.5802/ojmo.15 · Cited by 506
An optimal method for stochastic composite optimization
Lan, G. (2012) · Mathematical Programming · doi:10.1007/s10107-010-0434-y · Cited by 427
“Recent theoretical studies (cf., [16,45,46]) and numerical experiments (see e.g., [23,27,51]) show that the SAA method coupled with a good (deterministic) algorithm could be reasonably efficient for solving certain classes of two stage stochastic programming problems.”
Method
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
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.