On the public citation graph
A segmented algorithm for simulated annealing
0 signed · 35 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.1007/978-94-011-3436-1openalex-snapshot
Theory of Global Random Search
inferredcites →https://doi.org/10.1007/bf01890544openalex-snapshot
Optimal decomposition of probabilistic networks by simulated annealing
inferredcites →https://doi.org/10.1016/0378-4754(92)90017-bopenalex-snapshot
Theory of global random search
inferredcites →https://doi.org/10.1063/1.1699114openalex-snapshot
Equation of State Calculations by Fast Computing Machines
inferredcites →https://doi.org/10.1080/00401706.1969.10490717openalex-snapshot
Constrained Maximisation and the Design of Experiments
inferredcites →https://doi.org/10.1080/00401706.1986.10488128openalex-snapshot
Generalized Simulated Annealing for Function Optimization
inferredcites →https://doi.org/10.1080/00401706.1987.10488272openalex-snapshot
The Application of the Annealing Algorithm to the Construction of Exact Optimal Designs for Linear – Regression Models
inferredcites →https://doi.org/10.1080/01966324.1988.10737244openalex-snapshot
Constructing Exact D-Optimal Experimental Designs by Simulated Annealing
inferredcites →https://doi.org/10.1093/oso/9780198522546.001.0001openalex-snapshot
Optimum Experimental Designs
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.1145/29380.29864openalex-snapshot
Minimizing multimodal functions of continuous variables with the “simulated annealing” algorithm—Corrigenda for this article is available here
inferredcites →https://doi.org/10.1287/opre.37.6.865openalex-snapshot
Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s10898-009-9425-zopenalex-snapshot
Stopping and restarting strategy for stochastic sequential search in global optimization
inferred← citeshttps://doi.org/10.1007/s10898-020-00937-5openalex-snapshot
Stochastic optimization with adaptive restart: a framework for integrated local and global learning
inferred← citeshttps://doi.org/10.1007/s43069-021-00068-xopenalex-snapshot
Review on Nature-Inspired Algorithms
inferred← citeshttps://doi.org/10.1016/j.chemolab.2022.104560openalex-snapshot
Strategies for robust designs in toxicological tests
inferred← citeshttps://doi.org/10.1016/j.conengprac.2005.01.002openalex-snapshot
Submarine manoeuvring controllers’ optimisation using simulated annealing and genetic algorithms
inferred← citeshttps://doi.org/10.1016/j.csda.2016.06.014openalex-snapshot
Application of imperialist competitive algorithm to find minimax and standardized maximin optimal designs
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)57926-4openalex-snapshot
Segmented Simulated Annealing Applied to Sliding Mode Controller Design
inferred← citeshttps://doi.org/10.1017/s0001867800010727openalex-snapshot
Restarting search algorithms with applications to simulated annealing
inferred← citeshttps://doi.org/10.1023/a:1018538202952openalex-snapshot
Comparison of a genetic algorithm and simulated annealing in an application to statistical image reconstruction
inferred← citeshttps://doi.org/10.1049/ip-sen:20045001openalex-snapshot
Constructing multiple unique input/output sequences using metaheuristic optimisation techniques
inferred← citeshttps://doi.org/10.1109/qce60285.2024.11030870openalex-snapshot
Towards Robust Benchmarking of Quantum Optimization Algorithms
inferred← citeshttps://doi.org/10.1111/j.2517-6161.1996.tb02069.xopenalex-snapshot
Discussion of the Papers by Atkinson, and Bates et al.
inferred← citeshttps://doi.org/10.1533/9780857096050.165openalex-snapshot
Experimental modelling: system identification, parameter estimation and model optimisation techniques
inferred← citeshttps://doi.org/10.2139/ssrn.5126080openalex-snapshot
Automated Experimental Design with Optimization from Historical Data Simulations
inferred← citeshttps://doi.org/10.2307/2348448openalex-snapshot
Optimization Using Simulated Annealing
inferred← citeshttps://doi.org/10.4314/gjs.v63i2.2openalex-snapshot
A- and D-optimal designs in real life data using imperialist comparative algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.2110.03790openalex-snapshot
Scaling Bayesian Optimization With Game Theory
inferred← citeshttps://doi.org/10.51387/23-nejsds44openalex-snapshot
Nature-inspired Metaheuristics for finding Optimal Designs for the Continuation-Ratio Models
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.