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.
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
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-citation
Cited by
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
Formal Methods for Autonomous Systems
Wongpiromsarn, T., Ghasemi, M., Cubuktepe, M., Bakirtzis, G., Carr, S., Karabag, M. O., Neary, C., Gohari, P., & Topcu, U. (2023) · Foundations and Trends® in Systems and Control · doi:10.1561/2600000029 · Cited by 17
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Sampling-and-Discarding Approach to Chance-Constrained Optimization: Feasibility and Optimality. https://app.cochat.ai/papers/10.1007/s10957-010-9754-6
- The paper
- Campi, M. C., & Garatti, S. (2011). A Sampling-and-Discarding Approach to Chance-Constrained Optimization: Feasibility and Optimality. Journal of Optimization Theory and Applications. https://doi.org/10.1007/s10957-010-9754-6
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.
