The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
An outer-approximation algorithm for a class of mixed-integer nonlinear programs
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
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
Partitioning procedures for solving mixed-variables programming problems
Benders, J. F. (1962) · Numerische Mathematik · doi:10.1007/bf01386316 · Cited by 3,855
Nemhauser, G. L., & Wolsey, L. A. (1972) · Cited by 3,371
Generalized Benders decomposition
Geoffrion, A. M. (1972) · Journal of Optimization Theory and Applications · doi:10.1007/bf00934810 · Cited by 2,478
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
Convexity and Optimization in Finite Dimensions I
Stoer, J., & Witzgall, C. (1970) · Springer eBooks · doi:10.1007/978-3-642-46216-0 · Cited by 885
An Algorithm for the Discrete Network Design Problem
LeBlanc, L. J. (1975) · Transportation Science · doi:10.1287/trsc.9.3.183 · Cited by 473
Elements of Large-Scale Mathematical Programming Part I: Concepts
Geoffrion, A. M. (1970) · Management Science · doi:10.1287/mnsc.16.11.652 · Cited by 266
A central cutting plane algorithm for the convex programming problem
Elzinga, J., & Moore, T. G. (1975) · Mathematical Programming · doi:10.1007/bf01580439 · Cited by 135
Mangasrian, O. L. (1972) · Journal of Engineering for Industry · doi:10.1115/1.3428164 · Cited by 134
Cited by
Biegler, L. T., & Grossmann, I. E. (2004) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2003.11.003 · Cited by 593
Self-citationSpatio-Temporal Coordinated V2V Energy Swapping Strategy for Mobile PEVs
Wang, M., Ismail, M., Zhang, R., Shen, X., Serpedin, E., & Qaraqe, K. (2018) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2016.2593667 · Cited by 94
Hou, Y., Givisiez, A. G., Liu, M. Z., & Ochoa, L. F. (2025) · Sustainable Energy, Grids and Networks · doi:10.1016/j.segan.2024.101615 · Cited by 7
Metadata
- Authors
- Duran, M. A., & Grossmann, I. E.
- Venue
- Mathematical Programming
- Published
- 1986-10
- Volume
- 36
- Issue
- 3
- Pages
- 307-339
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2071334094
- Cited by
- 1,447
- References
- 12
- FWCI
- 7.45
- 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: An outer-approximation algorithm for a class of mixed-integer nonlinear programs. https://app.cochat.ai/papers/10.1007/bf02592064
- The paper
- Duran, M. A., & Grossmann, I. E. (1986). An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Mathematical Programming. https://doi.org/10.1007/bf02592064
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.
