On the public citation graph
On when to stop sampling for the maximum
0 signed · 32 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/j.1538-7305.1965.tb04146.xopenalex-snapshot
Computer Solutions of the Traveling Salesman Problem
inferredcites →https://doi.org/10.1007/bf01584254openalex-snapshot
A statistical estimate of the structure of multi-extremal problems
inferredcites →https://doi.org/10.1007/bf02591684openalex-snapshot
Bayesian stopping rules for multistart global optimization methods
inferredcites →https://doi.org/10.1007/bf02592015openalex-snapshot
Sequential stopping rules for the multistart algorithm in global optimisation
inferredcites →https://doi.org/10.1007/bf02592071openalex-snapshot
Stochastic global optimization methods part II: Multi level methods
inferredcites →https://doi.org/10.1080/00401706.1987.10488304openalex-snapshot
Numerical Recipes: The Art of Scientific Computing
inferredcites →https://doi.org/10.1080/02331939008843596openalex-snapshot
Stopping eules for the multistart method when different local minima have different function values
inferredcites →https://doi.org/10.1111/j.1467-9574.1990.tb01275.xopenalex-snapshot
A Bayesian learning procedure for the.(s, Q) inventory policy
inferredcites →https://doi.org/10.1111/j.1467-9574.2007.00380.xopenalex-snapshot
Statistica Neerlandica 61, 2007
inferredcites →https://doi.org/10.1119/1.14981openalex-snapshot
Numerical Recipes, The Art of Scientific Computing
inferredcites →https://doi.org/10.1137/1.9781611970654.ch1openalex-snapshot
1. Bayesian Statistics a Review
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_491openalex-snapshot
Stochastic Global Optimization: Stopping Rules
inferred← citeshttps://doi.org/10.1007/3-540-48774-3_15openalex-snapshot
Neural Network Approach to Design of Distributed Hard Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_647openalex-snapshot
Stochastic Global Optimization: Stopping Rules
inferred← citeshttps://doi.org/10.1007/978-1-4757-5362-2_5openalex-snapshot
Two-Phase Methods for Global Optimization
inferred← citeshttps://doi.org/10.1023/a:1008294209959openalex-snapshot
Trace-Based Methods for Solving Nonlinear Global Optimization and Satisfiability Problems
inferred← citeshttps://doi.org/10.1080/01621459.1994.10476895openalex-snapshot
Statistical Disclosure in Two-Dimensional Tables: General Tables
inferred← citeshttps://doi.org/10.1103/physreve.55.6219openalex-snapshot
Bayesian method for global optimization
inferred← citeshttps://doi.org/10.1137/090773143openalex-snapshot
Fixed-Width Sequential Stopping Rules for a Class of Stochastic Programs
inferred← citeshttps://doi.org/10.1137/s1052623494277317openalex-snapshot
Sequential Stopping Rules for Random Optimization Methods with Applications to Multistart Local Search
inferred← citeshttps://doi.org/10.1162/evco_a_00089openalex-snapshot
Black Box Optimization Benchmarking of the GLOBAL Method
inferred← citeshttps://doi.org/10.1287/opre.48.3.390.12436openalex-snapshot
Nested Partitions Method for Global Optimization
inferred← citeshttps://doi.org/10.14232/phd.625openalex-snapshot
Global optimization algorithms for bound constrained problems
inferred← citeshttps://doi.org/10.31449/inf.v45i2.3105openalex-snapshot
ParallelGlobal with Low Thread Interactions
inferred← citeshttps://doi.org/10.32657/10356/6217openalex-snapshot
New interval partitioning algorithms for global optimization problems
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.