The DOI matches its Crossref record; 85 of the 85 references it cites were found in a registry or an index.
Non-convex mixed-integer nonlinear programming: A survey
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
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
Generalized Benders decomposition
Geoffrion, A. M. (1972) · Journal of Optimization Theory and Applications · doi:10.1007/bf00934810 · Cited by 2,478
Global Optimization with Polynomials and the Problem of Moments
Lasserre, J. B. (2001) · SIAM Journal on Optimization · doi:10.1137/s1052623400366802 · Cited by 2,474
McCormick, G. P. (1976) · Mathematical Programming · doi:10.1007/bf01580665 · Cited by 2,281
An Automatic Method for Solving Discrete Programming Problems
Land, A. H., & Doig, A. G. (2010) · 50 Years of Integer Programming 1958-2008 · doi:10.1007/978-3-540-68279-0_5 · Cited by 1,988
An Automatic Method of Solving Discrete Programming Problems
Land, A. H., & Doig, A. G. (1960) · Econometrica · doi:10.2307/1910129 · Cited by 1,942
Global Optimization: Deterministic Approaches
Horst, R., & Hoang, T. (1992) · Cited by 1,635
An outer-approximation algorithm for a class of mixed-integer nonlinear programs
Duran, M. A., & Grossmann, I. E. (1986) · Mathematical Programming · doi:10.1007/bf02592064 · Cited by 1,447
A polyhedral branch-and-cut approach to global optimization
Tawarmalani, M., & Sahinidis, N. V. (2005) · Mathematical Programming · doi:10.1007/s10107-005-0581-8 · Cited by 1,225
Computers and Chemical Engineering
Biegler, L. T., & Zavala, V. M. (2008) · Cited by 1,200
Cited by
Wu, Q., & Zhang, R. (2020) · IEEE Transactions on Communications · doi:10.1109/tcomm.2019.2958916 · Cited by 1,287
ANTIGONE: Algorithms for coNTinuous / Integer Global Optimization of Nonlinear Equations
Misener, R., & Floudas, C. A. (2014) · Journal of Global Optimization · doi:10.1007/s10898-014-0166-2 · Cited by 505
Mixed Integer Linear Programming Formulation Techniques
Vielma, J. P. (2015) · SIAM Review · doi:10.1137/130915303 · Cited by 358
Gebbran, D., Mhanna, S., Chapman, A. C., & Verbič, G. (2023) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2022.3227635 · Cited by 38
Metadata
- Authors
- Burer, S., & Letchford, A. N.
- Venue
- Surveys in Operations Research and Management Science
- Publisher
- Elsevier BV
- Published
- 2012-07
- Volume
- 17
- Issue
- 2
- Pages
- 97-106
- ISSN
- 1876-7354 (ISSN-L)
- OpenAlex
- W2155014525
- Cited by
- 547
- References
- 85
- FWCI
- 25.88
- 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: Non-convex mixed-integer nonlinear programming: A survey. https://app.cochat.ai/papers/10.1016/j.sorms.2012.08.001
- The paper
- Burer, S., & Letchford, A. N. (2012). Non-convex mixed-integer nonlinear programming: A survey. Surveys in Operations Research and Management Science. https://doi.org/10.1016/j.sorms.2012.08.001
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.