The DOI matches its Crossref record; 143 of the 143 references it cites were found in a registry or an index.
Monte Carlo sampling-based methods for stochastic optimization
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
Theory of games and economic behavior
(2019) · 100 Years of Math Milestones · doi:10.1090/mbk/121/32 · Cited by 16,632
A Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643
McKay, M. D., Beckman, R. J., & Conover, W. J. (2000) · Technometrics · doi:10.2307/1271432 · Cited by 7,415
Theory of Games and Economic Behavior
N., E., von Neumann, J., & Morgenstern, O. (1945) · The Journal of Philosophy · doi:10.2307/2019327 · Cited by 4,006
Partitioning procedures for solving mixed-variables programming problems
Benders, J. F. (1962) · Numerische Mathematik · doi:10.1007/bf01386316 · Cited by 3,855
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5086 · Cited by 3,515
Theory of Games and Economic Behavior
ROWLAND, E. (1946) · Nature · doi:10.1038/157172a0 · Cited by 3,280
McKay, M. D., Beckman, R. J., & Conover, W. J. (1979) · Technometrics · doi:10.1080/00401706.1979.10489755 · Cited by 3,220
A Tutorial on the Cross-Entropy Method
de Boer, P.-T., Kroese, D. P., Mannor, S., & Rubinstein, R. Y. (2005) · Annals of Operations Research · doi:10.1007/s10479-005-5724-z · Cited by 3,024
Random Number Generation and Quasi-Monte Carlo Methods.
Collings, B. J., & Niederreiter, H. (1993) · Journal of the American Statistical Association · doi:10.2307/2290359 · Cited by 2,884
Random Number Generation and Quasi-Monte Carlo Methods
Niederreiter, H. (1992) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970081 · Cited by 2,770
Chance-Constrained Programming
Charnes, A., & Cooper, W. W. (1959) · Management Science · doi:10.1287/mnsc.6.1.73 · Cited by 2,742
Large Sample Properties of Simulations Using Latin Hypercube Sampling
Stein, M. (1987) · Technometrics · doi:10.1080/00401706.1987.10488205 · Cited by 2,471
Convex Analysis and Minimization Algorithms I
Hiriart-Urruty, J.-B., & Lemaréchal, C. (1993) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-662-02796-7 · Cited by 2,378
Stochastic Estimation of the Maximum of a Regression Function
Kiefer, J., & Wolfowitz, J. (1952) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729392 · Cited by 2,133
Stochastic orders and their applications
Shaked, M., & Shanthikumar, J. G. (1994) · Cited by 2,125
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-citationRobust Stochastic Approximation Approach to Stochastic Programming
Nemirovski, A., Juditsky, A., Lan, G., & Shapiro, A. (2009) · SIAM Journal on Optimization · doi:10.1137/070704277 · Cited by 1,945
Delage, E., & Ye, Y. (2010) · Operations Research · doi:10.1287/opre.1090.0741 · Cited by 1,893
Introduction to Stochastic Search and Optimization: Estimation, Simulation, and Control
Spall, J. C. (2003) · Wiley eBooks · doi:10.1002/0471722138 · Cited by 1,890
Acceleration of Stochastic Approximation by Averaging
Polyak, B. T., & Juditsky, A. B. (1992) · SIAM Journal on Control and Optimization · doi:10.1137/0330046 · Cited by 1,827 · cited 2×
“An important development was provided by Polyak and Juditsky [197], who proposed a simple but powerful idea: rather than looking at the iterates {x k } defined in (15), one should analyze the average iterates ¯ x k := 1 k k−1 i=0 x i .”
MethodMonte Carlo: Concepts, Algorithms, and Applications
Wasserstein, R. L. (1997) · Technometrics · doi:10.1080/00401706.1997.10485133 · Cited by 1,790
The Cutting-Plane Method for Solving Convex Programs
Kelley, Jr. (1960) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0108053 · Cited by 1,549
Neuro-Dynamic Programming: NDP
Bertsekas, D. P. (2001) · Encyclopedia of Optimization · doi:10.1007/0-306-48332-7_333 · Cited by 1,466
Comparison Methods for Stochastic Models and Risks
Müller, A., & Stoyan, D. (2002) · Cited by 1,465
Stochastic Approximation Methods for Constrained and Unconstrained Systems
Kushner, H. J., & Clark, D. S. (1978) · Applied Mathematical Sciences · doi:10.1007/978-1-4684-9352-8 · Cited by 1,459
Multi-stage stochastic optimization applied to energy planning
Pereira, M. V. F., & Pinto, L. M. V. G. (1991) · Mathematical Programming · doi:10.1007/bf01582895 · Cited by 1,361
THE INSTITUTEOF ELECTRICAL AND ELECTRONICS ENGINEERS,INC.
Blackmon, H., Harder, E. L., Saito, S., Sinclair, G. W., Siusskind, C., Pratt, H., Tucker, E., Consultant, S., & Taylor, H. (1966) · Cited by 1,344
Problem complexity and method efficiency in optimization
(1984) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(84)90101-0 · Cited by 1,329
L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
Van Slyke, R. M., & Wets, R. (1969) · SIAM Journal on Applied Mathematics · doi:10.1137/0117061 · Cited by 1,281
Comparison Methods for Stochastic Models and Risks
McComb, M. A. (2003) · Technometrics · doi:10.1198/tech.2003.s176 · Cited by 1,244
Convex Approximations of Chance Constrained Programs
Nemirovski, A., & Shapiro, A. (2007) · SIAM Journal on Optimization · doi:10.1137/050622328 · Cited by 1,160
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
Rubinstein, R. Y., & Kroese, D. P. (2004) · Medical Entomology and Zoology · Cited by 1,074
Scenario reduction in stochastic programming
Dupa?ov�, J., Gr�we-Kuska, N., & R�misch, W. (2003) · Mathematical Programming · doi:10.1007/s10107-002-0331-0 · Cited by 1,041
INTRODUCTION TO STOCHASTIC SEARCH AND OPTIMIZATION: ESTIMATION, SIMULATION, AND CONTROL
Nowak, W. (2012) · Medical Entomology and Zoology · Cited by 1,033
Proceedings of the 2004 Winter Simulation Conference
(2004) · Proceedings of the 2004 Winter Simulation Conference, 2004. · doi:10.1109/wsc.2004.1371428 · Cited by 998
Stochastic Approximation Algorithms and Applications
Puhalskii, A., Kushner, H. J., & Yin, G. G. (1998) · Journal of the American Statistical Association · doi:10.2307/2669885 · Cited by 994
Scenario Reduction Algorithms in Stochastic Programming
Heitsch, H., & Römisch, W. (2003) · Computational Optimization and Applications · doi:10.1023/a:1021805924152 · Cited by 982
Shapiro, A. (2003) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(03)10006-0 · Cited by 916 · cited 22×
“For details on this result, as well as an extension to the constrained case, we refer to King and Rockafellar [133], Shapiro [217], and Rubinstein and Shapiro [210].”
BackgroundInfluentialPrimal-dual subgradient methods for convex problems
Nesterov, Y. (2009) · Mathematical Programming · doi:10.1007/s10107-007-0149-x · Cited by 835
Monte Carlo: Concepts, Algorithms, and Applications
(1996) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(97)80822-9 · Cited by 795
Portfolio optimization with conditional value-at-risk objective and constraints
Krokhmal, P., Uryasev, T., & Palmquist, J. (2001) · The Journal of Risk · doi:10.21314/jor.2002.057 · Cited by 780
Feature Article: Optimization for simulation: Theory vs. Practice
Fu, M. C. (2002) · INFORMS Journal on Computing · doi:10.1287/ijoc.14.3.192.113 · Cited by 742
Monte 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
A Sample Approximation Approach for Optimization with Probabilistic Constraints
Luedtke, J., & Ahmed, S. (2008) · SIAM Journal on Optimization · doi:10.1137/070702928 · Cited by 698
Gradient Estimation via Perturbation Analysis
(1991) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(91)90124-l · Cited by 692
Digital Nets and Sequences: Discrepancy Theory and Quasi–Monte Carlo Integration
Dick, J., & Pillichshammer, F. (2010) · Cambridge University Press eBooks · doi:10.1017/cbo9780511761188 · Cited by 681
Generating Scenario Trees for Multistage Decision Problems
Høyland, K., & Wallace, S. W. (2001) · Management Science · doi:10.1287/mnsc.47.2.295.9834 · Cited by 673
Distributionally Robust Optimization and Its Tractable Approximations
Goh, J., & Sim, M. (2010) · Operations Research · doi:10.1287/opre.1090.0795 · Cited by 668
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
Numerical Techniques for Stochastic Optimization
(1988) · Springer Series in Computational Mathematics · doi:10.1007/978-3-642-61370-8 · Cited by 632
Global Optimization of Stochastic Black-Box Systems via Sequential Kriging Meta-Models
Huang, D., Allen, T. T., Notz, W. I., & Zeng, N. (2006) · Journal of Global Optimization · doi:10.1007/s10898-005-2454-3 · Cited by 625
Stochastic Kriging for Simulation Metamodeling
Ankenman, B., Nelson, B. L., & Staum, J. (2010) · Operations Research · doi:10.1287/opre.1090.0754 · Cited by 622
Sample Average Approximation Method for Chance Constrained Programming: Theory and Applications
Pagnoncelli, B. K., Ahmed, S., & Shapiro, A. (2009) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-009-9523-6 · Cited by 523
Scenario reduction in stochastic programming: An approach using probability metrics
Dupačová, J., Gröwe‐Kuska, N., & Römisch, W. (2000) · doi:10.18452/2876 · Cited by 517
The O.D.E. Method for Convergence of Stochastic Approximation and Reinforcement Learning
Borkar, V. S., & Meyn, S. P. (2000) · SIAM Journal on Control and Optimization · doi:10.1137/s0363012997331639 · Cited by 499
Monte Carlo and Quasi-Monte Carlo Sampling
(2009) · Springer Series in Statistics · doi:10.1007/978-0-387-78165-5 · Cited by 497
Verweij, B., Ahmed, S., Kleywegt, A. J., Nemhauser, G. L., & Shapiro, A. (2003) · Computational Optimization and Applications · doi:10.1023/a:1021814225969 · Cited by 494
A Knowledge-Gradient Policy for Sequential Information Collection
Frazier, P. I., Powell, W. B., & Dayanik, S. (2008) · SIAM Journal on Control and Optimization · doi:10.1137/070693424 · Cited by 447
An optimal method for stochastic composite optimization
Lan, G. (2012) · Mathematical Programming · doi:10.1007/s10107-010-0434-y · Cited by 427 · cited 1×
“Lan [141] provided further enhancement to the mirror-descent algorithm by introducing new sequences that aggregate the iterates; the resulting method—called Accelerated SA—is shown to achieve optimal rate of convergence both in the smooth and nonsmooth cases.”
MethodThe 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
Optimization via simulation: A review
Fu, M. C. (1994) · Annals of Operations Research · doi:10.1007/bf02136830 · Cited by 417
The Knowledge-Gradient Policy for Correlated Normal Beliefs
Frazier, P., Powell, W., & Dayanik, S. (2009) · INFORMS Journal on Computing · doi:10.1287/ijoc.1080.0314 · Cited by 408
Proceedings of the Winter Simulation Conference
Rose, O., & Uhrmacher, A. M. (2012) · Winter Simulation Conference · Cited by 401
Proceedings of the 2006 Winter Simulation Conference
(2006) · Proceedings of the 2006 Winter Simulation Conference · doi:10.1109/wsc.2006.323029 · Cited by 399
A Sampling-and-Discarding Approach to Chance-Constrained Optimization: Feasibility and Optimality
Campi, M. C., & Garatti, S. (2011) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-010-9754-6 · Cited by 398
Goodfriend, J. H., Rubinstein, R. Y., & Shapiro, A. (1995) · Technometrics · doi:10.1080/00401706.1995.10485910 · Cited by 393
A branch and bound method for stochastic global optimization
Norkin, V. I., Pflug, G. C., & Ruszczyński, A. (1998) · Mathematical Programming · doi:10.1007/bf02680569 · Cited by 382
Introduction to Stochastic Search and Optimization: Estimation, Simulation, and Control
Frey, J. (2004) · Journal of the American Statistical Association · doi:10.1198/jasa.2004.s362 · Cited by 375
Sample size selection in optimization methods for machine learning
Byrd, R. H., Chin, G. M., Nocedal, J., & Wu, Y. (2012) · Mathematical Programming · doi:10.1007/s10107-012-0572-5 · Cited by 369
Proceedings of the 2010 Winter Simulation Conference
Zee, V. D. D., Lahr, M. M. H., Luijckx, G. J., & Buskens, E. (2010) · Winter Simulation Conference · Cited by 367
The scenario approach for systems and control design
Campi, M. C., Garatti, S., & Prandini, M. (2009) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2009.07.001 · Cited by 367
On a Stochastic Approximation Method
Chung, K. L. (1954) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177728716 · Cited by 363
A simulation-based approach to two-stage stochastic programming with recourse
Shapiro, A., & Homem‐de‐Mello, T. (1998) · Mathematical Programming · doi:10.1007/bf01580086 · Cited by 338
Self-citationScenario tree generation for multiperiod financial optimization by optimal discretization
Pflug, G. C. (2001) · Mathematical Programming · doi:10.1007/pl00011398 · Cited by 337
Dupačová, J., & Wets, R. J. ‐. (1988) · The Annals of Statistics · doi:10.1214/aos/1176351052 · Cited by 309
Stochastic Vehicle Routing with Random Travel Times
Kenyon, A. S., & Morton, D. P. (2003) · Transportation Science · doi:10.1287/trsc.37.1.69.12820 · Cited by 300
Stochastic Simulation Optimization with Optimal Computing Budget Allocation
Pedrielli, G., Lee, L. H., & Chen, C.-H. (2024) · Encyclopedia of Optimization · doi:10.1007/978-3-030-54621-2_836-1 · Cited by 288
stochastic quasigradient methods and their application to system optimization†
Ermoliev, Y. (1983) · Stochastics · doi:10.1080/17442508308833246 · Cited by 280
Higle, J. L., & Sen, S. (1996) · Nonconvex optimization and its applications · doi:10.1007/978-1-4615-4115-8 · Cited by 276
Sample-path solution of stochastic variational inequalities
Gürkan, G., Yonca Özge, A., & Robinson, S. M. (1999) · Mathematical Programming · doi:10.1007/s101070050024 · Cited by 271
A Guide to Sample Average Approximation
Kim, S., Pasupathy, R., & Henderson, S. G. (2015) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4939-1384-8_8 · Cited by 268
Chapter 18 Metamodel-Based Simulation Optimization
Barton, R. R., & Meckesheimer, M. (2006) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(06)13018-2 · Cited by 265
Asymptotic analysis of stochastic programs
Shapiro, A. (1991) · Annals of Operations Research · doi:10.1007/bf02204815 · Cited by 259
Optimization of Stochastic Models
Pflug, G. C. (1996) · Kluwer international series in engineering and computer science · doi:10.1007/978-1-4613-1449-3 · Cited by 259
A Central Limit Theorem for Latin Hypercube Sampling
Owen, A. B. (1992) · Journal of the Royal Statistical Society Series B (Statistical Methodology) · doi:10.1111/j.2517-6161.1992.tb01895.x · Cited by 257
Recent Advances in Randomized Quasi-Monte Carlo Methods
L’Ecuyer, P., & Lemieux, C. (2002) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48102-2_20 · Cited by 254
On 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-citationAnalysis of Sample-Path Optimization
Robinson, S. M. (1996) · Mathematics of Operations Research · doi:10.1287/moor.21.3.513 · Cited by 248
Latin supercube sampling for very high-dimensional simulations
Owen, A. B. (1998) · ACM Transactions on Modeling and Computer Simulation · doi:10.1145/272991.273010 · Cited by 244
On the Use of Stochastic Hessian Information in Optimization Methods for Machine Learning
Byrd, R. H., Chin, G. M., Neveitt, W., & Nocedal, J. (2011) · SIAM Journal on Optimization · doi:10.1137/10079923x · Cited by 242
The Scenario Approach for Systems and Control Design
Campi, M. C., Garatti, S., & Prandini, M. (2008) · IFAC Proceedings Volumes · doi:10.3182/20080706-5-kr-1001.00065 · Cited by 237
Selecting a Selection Procedure
Branke, J., Chick, S. E., & Schmidt, C. (2007) · Management Science · doi:10.1287/mnsc.1070.0721 · Cited by 235
On the convergence of stochastic dual dynamic programming and related methods
Philpott, A. B., & Guan, Z. (2008) · Operations Research Letters · doi:10.1016/j.orl.2008.01.013 · Cited by 232
Multi-stage stochastic linear programs for portfolio optimization
Dantzig, G. B., & Infanger, G. (1993) · Annals of Operations Research · doi:10.1007/bf02282041 · Cited by 223
The Generalized Jackknife Statistic
Strawderman, W. E. (1973) · Journal of Quality Technology · doi:10.1080/00224065.1973.11980580 · Cited by 220
A practical inventory control policy using operational statistics
Liyanage, L. H., & Shanthikumar, J. G. (2005) · Operations Research Letters · doi:10.1016/j.orl.2004.08.003 · Cited by 215
Probabilistic and Randomized Methods for Design under Uncertainty
(2006) · Springer eBooks · doi:10.1007/b138725 · Cited by 212
Scott, W., Frazier, P., & Powell, W. (2011) · SIAM Journal on Optimization · doi:10.1137/100801275 · Cited by 209
Nelder-Mead Simplex Modifications for Simulation Optimization
Barton, R. R., & Ivey, J. S. (1996) · Management Science · doi:10.1287/mnsc.42.7.954 · Cited by 209
Sequential Convex Approximations to Joint Chance Constrained Programs: A Monte Carlo Approach
Hong, L. J., Yang, Y., & Zhang, L. (2011) · Operations Research · doi:10.1287/opre.1100.0910 · Cited by 191
Nelson, B. L. (1990) · Operations Research · doi:10.1287/opre.38.6.974 · Cited by 186
The Sample Average Approximation Method for Stochastic Programs with Integer Recourse
Ahmed, S., & Shapiro, A. (2002) · Cited by 179
Solving Chance-Constrained Stochastic Programs via Sampling and Integer Programming
Ahmed, S., & Shapiro, A. (2008) · doi:10.1287/educ.1080.0048 · Cited by 167
The Knowledge Gradient Algorithm for a General Class of Online Learning Problems
Ryzhov, I. O., Powell, W. B., & Frazier, P. I. (2012) · Operations Research · doi:10.1287/opre.1110.0999 · Cited by 159
Sample-path optimization of convex stochastic performance functions
Plambeck, E. L., Fu, B.-R., Robinson, S. M., & Suri, R. (1996) · Mathematical Programming · doi:10.1007/bf02592150 · Cited by 157
Xu, J., Nelson, B. L., & Hong, L. J. (2010) · ACM Transactions on Modeling and Computer Simulation · doi:10.1145/1667072.1667075 · Cited by 157
The minimax approach to stochastic programming and an illustrative application
Dupačová, J. (1987) · Stochastics · doi:10.1080/17442508708833436 · Cited by 154
Validation analysis of mirror descent stochastic approximation method
Lan, G., Nemirovski, A. S., & Shapiro, A. (2011) · Mathematical Programming · doi:10.1007/s10107-011-0442-6 · Cited by 153
Assessing solution quality in stochastic programs
Bayraksan, G., & Morton, D. P. (2006) · Mathematical Programming · doi:10.1007/s10107-006-0720-x · Cited by 150
Self-citationAn Adaptive Sampling Algorithm for Solving Markov Decision Processes
Chang, H. S., Fu, M. C., Hu, J., & Marcus, S. I. (2005) · Operations Research · doi:10.1287/opre.1040.0145 · Cited by 139
The Generalised Jackknife Statistic.
Springall, A., Gray, H. L., & Schucany, W. R. (1974) · Journal of the Royal Statistical Society Series C (Applied Statistics) · doi:10.2307/2347008 · Cited by 133
A Sequential Sampling Procedure for Stochastic Programming
Bayraksan, G., & Morton, D. P. (2011) · Operations Research · doi:10.1287/opre.1110.0926 · Cited by 129
Self-citationPySP: modeling and solving stochastic programs in Python
Watson, J., Woodruff, D. L., & Hart, W. E. (2012) · Mathematical Programming Computation · doi:10.1007/s12532-012-0036-1 · Cited by 124
THE DIMENSION DISTRIBUTION AND QUADRATURE TEST FUNCTIONS
Owen, A. B. (2003) · Cited by 123
Tutorials in Operations Research
Ribeiro, C. C., & Loiseau, I. (2012) · International Transactions in Operational Research · doi:10.1111/j.1475-3995.2011.00837.x · Cited by 116
Sequential Sampling with Economics of Selection Procedures
Chick, S. E., & Frazier, P. I. (2011) · Management Science · doi:10.1287/mnsc.1110.1425 · Cited by 114
Chang, K.-H., Hong, L. J., & Wan, H. (2012) · INFORMS journal on computing · doi:10.1287/ijoc.1120.0498 · Cited by 111
Homem‐de‐Mello, T. (2008) · SIAM Journal on Optimization · doi:10.1137/060657418 · Cited by 106
Self-citationPasupathy, R. (2010) · Operations Research · doi:10.1287/opre.1090.0773 · Cited by 102
Convergence Properties of Two-Stage Stochastic Programming
Dai, L., Chen, C.-H., & Birge, J. R. (2000) · Journal of Optimization Theory and Applications · doi:10.1023/a:1004649211111 · Cited by 96
Confidence Intervals for Steady-State Simulations II: A Survey of Sequential Procedures
Law, A. M., & Kelton, W. D. (1982) · Management Science · doi:10.1287/mnsc.28.5.550 · Cited by 96
Asymptotic Behavior of Optimal Solutions in Stochastic Programming
Shapiro, A. (1993) · Mathematics of Operations Research · doi:10.1287/moor.18.4.829 · Cited by 95
Broadie, M. N., Cicek, D. M., & Zeevi, A. J. (2011) · Operations Research · doi:10.1287/opre.1110.0970 · Cited by 84
Modeling Uncertainty: An Examination of Stochastic Theory, Methods, and Applications
Dror, M., L’Ecuyer, P., & Szidarovszky, F. (2002) · International series in management science/operations research/International series in operations research & management science · doi:10.1007/b106473 · Cited by 74
Epi-convergent discretizations of stochastic programs via integration quadratures
Pennanen, T., & Koivu, M. (2005) · Numerische Mathematik · doi:10.1007/s00211-004-0571-4 · Cited by 73
Stochastic root finding via retrospective approximation
Chen, H., & Schmeiser, B. W. (2001) · IIE Transactions · doi:10.1080/07408170108936827 · Cited by 72
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 70
Self-citationProbabilistic bounds (via large deviations) for the solutions of stochastic programming problems
Kaniovski, Y. M., King, A. J., & Wets, R. J. ‐. (1995) · Annals of Operations Research · doi:10.1007/bf02031707 · Cited by 69
Epi-Convergent Discretizations of Multistage Stochastic Programs
Pennanen, T. (2005) · Mathematics of Operations Research · doi:10.1287/moor.1040.0114 · Cited by 64
A Model Reference Adaptive Search Method for Stochastic Global Optimization
Fu, M. C., Hu, J., & Marcus, S. I. (2008) · Communications in Information and Systems · doi:10.4310/cis.2008.v8.n3.a4 · Cited by 62
Variance Reduction and Objective Function Evaluation in Stochastic Linear Programs
Higle, J. L. (1998) · INFORMS journal on computing · doi:10.1287/ijoc.10.2.236 · Cited by 58
Duality and statistical tests of optimality for two stage stochastic programs
Higle, J. L., & Sen, S. (1996) · Mathematical Programming · doi:10.1007/bf02592155 · Cited by 56
Variance reduction in sample approximations of stochastic programs
Koivu, M. (2004) · Mathematical Programming · doi:10.1007/s10107-004-0557-0 · Cited by 52
A Distributional Interpretation of Robust Optimization
Xu, H., Caramanis, C., & Mannor, S. (2012) · Mathematics of Operations Research · doi:10.1287/moor.1110.0531 · Cited by 47
Computationally Efficient Nonparametric Importance Sampling
Neddermeyer, J. C. (2009) · Journal of the American Statistical Association · doi:10.1198/jasa.2009.0122 · Cited by 46
Response surface analysis of two-stage stochastic linear programming with recourse
Bailey, T. G., Jensen, P. A., & Morton, D. P. (1999) · Naval Research Logistics (NRL) · doi:10.1002/(sici)1520-6750(199910)46:7<753::aid-nav1>3.0.co;2-m · Cited by 43
A Bayesian stochastic programming approach to an employee scheduling problem
Morton, D. P., & Popova, E. (2004) · IIE Transactions · doi:10.1080/07408170490245450 · Cited by 35
Antithetic Variates, Multivariate Dependence and Simulation of Stochastic Systems
Rubinstein, R. Y., Samorodnitsky, G. P., & Shaked, M. (1985) · Management Science · doi:10.1287/mnsc.31.1.66 · Cited by 35
Fast Generation of Randomized Low-Discrepancy Point Sets
Friedel, I., & Keller, A. (2002) · Springer eBooks · doi:10.1007/978-3-642-56046-0_17 · Cited by 32
Retrospective-approximation algorithms for the multidimensional stochastic root-finding problem
Pasupathy, R., & Schmeiser, B. W. (2009) · ACM Transactions on Modeling and Computer Simulation · doi:10.1145/1502787.1502788 · Cited by 27
Newsvendor-type models with decision-dependent uncertainty
Lee, S., Homem‐de‐Mello, T., & Kleywegt, A. J. (2012) · Mathematical Methods of Operations Research · doi:10.1007/s00186-012-0396-3 · Cited by 25
Self-citation
Cited by
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
Wasserstein Distributionally Robust Optimization: Theory and Applications in Machine Learning
Kuhn, D., Esfahani, P. M., Nguyen, V. A., & Shafieezadeh-Abadeh, S. (2019) · Operations Research & Management Science in the Age of Analytics · doi:10.1287/educ.2019.0198 · Cited by 342
Metadata
- Authors
- Homem-de-Mello, T., & Bayraksan, G.
- Venue
- Surveys in Operations Research and Management Science
- Publisher
- Elsevier BV
- Published
- 2014-01
- Volume
- 19
- Issue
- 1
- Pages
- 56-85
- ISSN
- 1876-7354 (ISSN-L)
- OpenAlex
- W1983221302
- Cited by
- 283
- References
- 143
- FWCI
- 19.72
- Type
- journal article
- 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.