The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
A Sampling-and-Discarding Approach to Chance-Constrained Optimization: Feasibility and Optimality
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
Bertsimas, D., & Sim, M. (2004) · Operations Research · doi:10.1287/opre.1030.0065 · Cited by 4,557
Handbooks in operations research and management science
Nemhauser, G. L., & Kan, A. H. G. R. (1989) · Elsevier eBooks · Cited by 2,436
Stochastic 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
Robust solutions of Linear Programming problems contaminated with uncertain data
Ben-Tal, A., & Nemirovski, A. (2000) · Mathematical Programming · doi:10.1007/pl00011380 · Cited by 1,744
Lectures on Stochastic Programming: Modeling and Theory
Shapiro, A., Dentcheva, D., & Ruszczyński, A. (2009) · Cited by 1,735
Prékopa, A. (1995) · Springer eBooks · doi:10.1007/978-94-017-3087-7 · Cited by 1,535
Robust optimization ? methodology and applications
Ben-Tal, A., & Nemirovski, A. (2002) · Mathematical Programming · doi:10.1007/s101070100286 · Cited by 1,409
Lectures on Stochastic Programming: Modeling and Theory
Shapiro, A., Dentcheva, D., & Ruszczyński, A. (2009) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718751 · Cited by 1,403
Convex Approximations of Chance Constrained Programs
Nemirovski, A., & Shapiro, A. (2007) · SIAM Journal on Optimization · doi:10.1137/050622328 · Cited by 1,160
The Scenario Approach to Robust Control Design
Calafiore, G. C., & Campi, M. C. (2006) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2006.875041 · Cited by 1,150
Self-citationShapiro, A. (2003) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(03)10006-0 · Cited by 916
Shiryaev, A. N. (1996) · Graduate texts in mathematics · doi:10.1007/978-1-4757-2539-1 · Cited by 834
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
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
Self-citationCost Horizons and Certainty Equivalents: An Approach to Stochastic Programming of Heating Oil
Charnes, A., Cooper, W. W., & Symonds, G. H. (1958) · Management Science · doi:10.1287/mnsc.4.3.235 · Cited by 623
The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
Campi, M. C., & Garatti, S. (2008) · SIAM Journal on Optimization · doi:10.1137/07069821x · Cited by 560
Self-citationA Theory of Learning and Generalization
Vidyasagar, M. (1997) · Springer eBooks · Cited by 492
Recent Advances in Learning and Control
(2008) · Lecture Notes in Control and Information Sciences · doi:10.1007/978-1-84800-155-8 · Cited by 441
On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
de Farias, D. P., & Van Roy, B. (2004) · Mathematics of Operations Research · doi:10.1287/moor.1040.0094 · Cited by 373
Ambiguous chance constrained problems and robust optimization
Erdoğan, E., & Iyengar, G. (2006) · Mathematical Programming · doi:10.1007/s10107-005-0678-0 · Cited by 302
Probabilistic and Randomized Methods for Design under Uncertainty
(2006) · Springer eBooks · doi:10.1007/b138725 · Cited by 212
Randomized Strategies for Probabilistic Solutions of Uncertain Feasibility and Optimization Problems
Álamo, T., Tempo, R., & Camacho, E. F. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2009.2031207 · Cited by 193
Randomized algorithms for probabilistic robustness with real and complex structured uncertainty
Calafiore, G. C., Dabbene, F., & Tempo, R. (2000) · IEEE Transactions on Automatic Control · doi:10.1109/9.895560 · Cited by 159
Convexity of chance constraints with independent random variables
Henrion, R., & Strugarek, C. (2007) · Computational Optimization and Applications · doi:10.1007/s10589-007-9105-1 · Cited by 133
On geometric optimization with few violated constraints
Matoušek, J. (1995) · Discrete & Computational Geometry · doi:10.1007/bf02570713 · Cited by 123
Stochastic Optimization and Statistical Inference
Pflug, G. C. (2003) · Handbooks in operations research and management science · doi:10.1016/s0927-0507(03)10007-2 · Cited by 54
Cited by
Stochastic Model Predictive Control: An Overview and Perspectives for Future Research
(2016) · IEEE Control Systems · doi:10.1109/mcs.2016.2602087 · Cited by 923
Learning-Based Model Predictive Control: Toward Safe Learning in Control
Hewing, L., Wabersich, K. P., Menner, M., & Zeilinger, M. N. (2020) · Annual Review of Control, Robotics, and Autonomous Systems · doi:10.1146/annurev-control-090419-075625 · Cited by 835
Ning, C., & You, F. (2019) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2019.03.034 · Cited by 343
Stochastic linear Model Predictive Control with chance constraints – A review
Farina, M., Giulioni, L., & Scattolini, R. (2016) · Journal of Process Control · doi:10.1016/j.jprocont.2016.03.005 · Cited by 342
Monte Carlo sampling-based methods for stochastic optimization
Homem-de-Mello, T., & Bayraksan, G. (2014) · Surveys in Operations Research and Management Science · doi:10.1016/j.sorms.2014.05.001 · Cited by 283
Metadata
- Authors
- Campi, M. C., & Garatti, S.
- Venue
- Journal of Optimization Theory and Applications
- Published
- 2010-10-15
- Volume
- 148
- Issue
- 2
- Pages
- 257-280
- ISSN
- 0022-3239 (ISSN-L)
- 1573-2878
- OpenAlex
- W2066778083
- Cited by
- 398
- References
- 26
- FWCI
- 16.57
- 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.