The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems
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
A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
Adams, W. P., & Sherali, H. D. (1986) · Management Science · doi:10.1287/mnsc.32.10.1274 · Cited by 255
Self-citationMixed-integer bilinear programming problems
Adams, W. P., & Sherali, H. D. (1993) · Mathematical Programming · doi:10.1007/bf01581249 · Cited by 98
Self-citation
Cited by
Mixed-integer nonlinear optimization
Belotti, P., Kirches, C., Leyffer, S., Linderoth, J., Luedtke, J., & Mahajan, A. (2013) · Acta Numerica · doi:10.1017/s0962492913000032 · Cited by 712
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
A review of recent advances in global optimization
Floudas, C. A., & Gounaris, C. E. (2009) · Journal of Global Optimization · doi:10.1007/s10898-008-9332-8 · Cited by 455
A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
Laurent, M. (2003) · Mathematics of Operations Research · doi:10.1287/moor.28.3.470.16391 · Cited by 373
GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi
Henrion, D., & Lasserre, J.-B. (2003) · ACM Transactions on Mathematical Software · doi:10.1145/779359.779363 · Cited by 369
Metadata
- Authors
- Sherali, H. D., & Adams, W. P.
- Venue
- Nonconvex Optimization and Its Applications
- Publisher
- Springer US
- Published
- 1999
- ISSN
- 1571-568X (ISSN-L)
- OpenAlex
- W4292175028
- Cited by
- 472
- References
- 2
- FWCI
- 0.59
- Type
- book
- 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.