The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Stochastic global optimization methods part II: Multi level methods
Open accessAbstract
In Part II of our paper, two stochastic methods for global optimization are described that, with probability 1, find all relevant local minima of the objective function with the smallest possible number of local searches. The computational performance of these methods is examined both analytically and empirically.
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
Data Structures and Network Algorithms
Tarjan, R. E. (1983) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970265 · Cited by 2,057
Zimmermann, H. (1979) · European Journal of Operational Research · doi:10.1016/0377-2217(79)90240-6 · Cited by 698
Numerical Methods for Non-Linear Optimization
Vajda, S., & Lootsma, F. A. (1973) · Operational Research Quarterly (1970-1977) · doi:10.2307/3008352 · Cited by 589
Stochastic global optimization methods part I: Clustering methods
Rinnooy Kan, A. H. G., & Timmer, G. T. (1987) · Mathematical Programming · doi:10.1007/bf02592070 · Cited by 463
Self-citationGeneralized descent for global optimization
Griewank, A. (1981) · Journal of Optimization Theory and Applications · doi:10.1007/bf00933356 · Cited by 381
Optimal Expected-Time Algorithms for Closest Point Problems
Bentley, J. L., Weide, B. W., & Yao, A. C.-C. (1980) · ACM Transactions on Mathematical Software · doi:10.1145/355921.355927 · Cited by 314
A method of unconstrained global optimization
Bremermann, H. (1970) · Mathematical Biosciences · doi:10.1016/0025-5564(70)90087-8 · Cited by 199
A multi-start global minimization algorithm with dynamic search trajectories
Snyman, J. A., & Fatti, L. P. (1987) · Journal of Optimization Theory and Applications · doi:10.1007/bf00940408 · Cited by 145
Stochastic Methods for Global Optimization
Kan, A. H. G. R., & Timmer, G. T. (1984) · American Journal of Mathematical and Management Sciences · doi:10.1080/01966324.1984.10737135 · Cited by 105
Self-citationBAYESIAN STOPPING RULES FOR A CLASS OF STOCHASTIC GLOBAL OPTIMIZATION METHODSPreprint
Boender, C. G. E., & Kan, A. H. G. R. (1983) · RePEc: Research Papers in Economics · doi:10.22004/ag.econ.272278 · Cited by 11
Cited by
Global Optimization of Statistical Functions with Simulated Annealing
Goffe, W. L., Ferrier, G. D., & Rogers, J. (1994) · Journal of Econometrics · doi:10.1016/0304-4076(94)90038-8 · Cited by 1,610
Scatter Search and Local NLP Solvers: A Multistart Framework for Global Optimization
Ugray, Z., Lasdon, L., Plummer, J., Glover, F., Kelly, J., & Martí, R. (2007) · INFORMS Journal on Computing · doi:10.1287/ijoc.1060.0175 · Cited by 726
A Stochastic Radial Basis Function Method for the Global Optimization of Expensive Functions
Regis, R. G., & Shoemaker, C. A. (2007) · INFORMS Journal on Computing · doi:10.1287/ijoc.1060.0182 · Cited by 528
Stochastic global optimization methods part I: Clustering methods
Rinnooy Kan, A. H. G., & Timmer, G. T. (1987) · Mathematical Programming · doi:10.1007/bf02592070 · Cited by 463
Self-citationAutomated Algorithm Selection: Survey and Perspectives
Kerschke, P., Hoos, H. H., Neumann, F., & Trautmann, H. (2019) · Evolutionary Computation · doi:10.1162/evco_a_00242 · Cited by 435
Metadata
- Authors
- Rinnooy Kan, A. H. G., & Timmer, G. T.
- Venue
- Mathematical Programming
- Published
- 1987-09
- Volume
- 39
- Issue
- 1
- Pages
- 57-78
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2080162860
- Cited by
- 379
- References
- 10
- FWCI
- 4.59
- Type
- journal article
- Language
- en
- Open access
- green
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: Stochastic global optimization methods part II: Multi level methods. https://app.cochat.ai/papers/10.1007/bf02592071
- The paper
- Rinnooy Kan, A. H. G., & Timmer, G. T. (1987). Stochastic global optimization methods part II: Multi level methods. Mathematical Programming. https://doi.org/10.1007/bf02592071
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.