The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
A polyhedral branch-and-cut approach to global optimization
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
Convex Analysis and Minimization Algorithms I
Hiriart-Urruty, J.-B., & Lemaréchal, C. (1993) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-662-02796-7 · Cited by 2,378
McCormick, G. P. (1976) · Mathematical Programming · doi:10.1007/bf01580665 · Cited by 2,281
Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation
Griewank, A., & Walther, A. (1987) · Cited by 2,166
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
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
Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming
Tawarmalani, M., & Sahinidis, N. V. (2002) · Nonconvex optimization and its applications · doi:10.1007/978-1-4757-3532-1 · Cited by 612
Self-citationGlobal optimization of mixed-integer nonlinear programs: A theoretical and computational study
Tawarmalani, M., & Sahinidis, N. V. (2004) · Mathematical Programming · doi:10.1007/s10107-003-0467-6 · Cited by 569
Self-citationSahinidis, N. V., & Tawarmalani, M. (2002) · Cited by 377
Self-citationA Nonlinear Programming Technique for the Optimization of Continuous Processing Systems
Griffith, R. E., & Stewart, R. A. D. (1961) · Management Science · doi:10.1287/mnsc.7.4.379 · Cited by 335
Zamora, J. M., & Grossmann, I. E. (1998) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(96)00346-8 · Cited by 175
Zamora, J. M., & Grossmann, I. E. (1999) · Journal of Global Optimization · doi:10.1023/a:1008312714792 · Cited by 144
Convex extensions and envelopes of lower semi-continuous functions
Tawarmalani, M., & Sahinidis, N. V. (2002) · Mathematical Programming · doi:10.1007/s10107-002-0308-z · Cited by 127
Self-citationSemidefinite Relaxations of Fractional Programs via Novel Convexification Techniques
Tawarmalani, M., & Sahinidis, N. V. (2001) · Journal of Global Optimization · doi:10.1023/a:1011233805045 · Cited by 111
Self-citationRelaxation and decomposition methods for mixed integer nonlinear programming
Nowak, I. (2005) · doi:10.18452/13962 · Cited by 90
Cited by
Derivative-free optimization: a review of algorithms and comparison of software implementations
Rios, L. M., & Sahinidis, N. V. (2013) · Journal of Global Optimization · doi:10.1007/s10898-012-9951-y · Cited by 1,276
Self-citationMixed-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
Advances in surrogate based modeling, feasibility analysis, and optimization: A review
Bhosekar, A., & Ierapetritou, M. (2018) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2017.09.017 · Cited by 707
Near-Field Communications: A Tutorial Review
Liu, Y., Wang, Z., Xu, J., Ouyang, C., Mu, X., & Schober, R. (2023) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2023.3305583 · Cited by 575
Non-convex mixed-integer nonlinear programming: A survey
Burer, S., & Letchford, A. N. (2012) · Surveys in Operations Research and Management Science · doi:10.1016/j.sorms.2012.08.001 · Cited by 547
Metadata
- Authors
- Tawarmalani, M., & Sahinidis, N. V.
- Venue
- Mathematical Programming
- Published
- 2005-05-03
- Volume
- 103
- Issue
- 2
- Pages
- 225-249
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2004407575
- Cited by
- 1,225
- References
- 14
- FWCI
- 4.35
- 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.