On the public citation graph

Some results characterizing the finite time behaviour of the simulated annealing algorithm

https://doi.org/10.1007/bf02823146
0 signed · 49 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/0-387-32792-4openalex-snapshot
Non-negative Matrices and Markov Chains
inferredcites →https://doi.org/10.1007/978-1-4757-5579-4openalex-snapshot
Introduction to Analytic Number Theory
inferredcites →https://doi.org/10.1007/978-3-662-28579-4openalex-snapshot
Introduction to Analytic Number Theory
inferredcites →https://doi.org/10.1007/978-94-015-7744-1openalex-snapshot
Simulated Annealing: Theory and Applications
inferredcites →https://doi.org/10.1007/bf00940812openalex-snapshot
Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
inferredcites →https://doi.org/10.1007/bf01007975openalex-snapshot
Nonstationary Markov chains and convergence of the annealing algorithm
inferredcites →https://doi.org/10.1016/0167-8655(85)90024-8openalex-snapshot
Restoration of binary images using stochastic relaxation with annealing
inferredcites →https://doi.org/10.1016/0167-9260(90)90018-vopenalex-snapshot
PLA logic minimization by simulated annealing
inferredcites →https://doi.org/10.1016/0378-4754(88)90023-7openalex-snapshot
Simulated annealing: theory and applications.
inferredcites →https://doi.org/10.1016/0890-5401(89)90067-9openalex-snapshot
Approximate counting, uniform generation and rapidly mixing Markov chains
inferredcites →https://doi.org/10.1017/s0269964800000723openalex-snapshot
Balance of Recurrece Order in Time-Inhomogenous Markov Chains with Application to Simulated Annealing
inferredcites →https://doi.org/10.1017/s0269964800003168openalex-snapshot
Quasi-Statically Cooled Markov Chains
inferredcites →https://doi.org/10.1017/s0269964800004733openalex-snapshot
Finite-Time Behavior of Slowly Cooled Annealing Chains
inferredcites →https://doi.org/10.1063/1.1698631openalex-snapshot
An Analytical Method of Calculating Variable Diffusion Coefficients
inferredcites →https://doi.org/10.1063/1.1699114openalex-snapshot
Equation of State Calculations by Fast Computing Machines
inferredcites →https://doi.org/10.1063/1.34823openalex-snapshot
Concepts of scale in simulated annealing
inferredcites →https://doi.org/10.1090/s0002-9947-1988-0930082-9openalex-snapshot
Bounds on the 𝐿² spectrum for Markov chains and Markov processes: a generalization of Cheeger’s inequality
inferredcites →https://doi.org/10.1109/dac.1996.545534openalex-snapshot
Proceedings of 33rd Design Automation Conference
inferredcites →https://doi.org/10.1109/iscas.2003.1206140openalex-snapshot
Proceedings Of The 2003 IEEE International Symposium On Circuits And systems
inferredcites →https://doi.org/10.1109/tassp.1984.1164450openalex-snapshot
Combinatorial optimization:Algorithms and complexity
inferredcites →https://doi.org/10.1109/tcad.1983.1270039openalex-snapshot
Global Wiring by Simulated Annealing
inferredcites →https://doi.org/10.1109/tpami.1984.4767596openalex-snapshot
Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.1137/0614063openalex-snapshot
On the Convergence of Reversible Markov Chains
inferredcites →https://doi.org/10.1137/s0363012991197171openalex-snapshot
Asymptotic First Hitting-Time Distribution of Annealing Processes
inferredcites →https://doi.org/10.1145/1687399openalex-snapshot
Proceedings of the 2009 International Conference on Computer-Aided Design
inferredcites →https://doi.org/10.1145/42282.46160openalex-snapshot
The time complexity of maximum matching by simulated annealing
inferredcites →https://doi.org/10.1145/73007.73043openalex-snapshot
A random polynomial time algorithm for approximating the volume of convex bodies
inferredcites →https://doi.org/10.1214/aoap/1177005980openalex-snapshot
Geometric Bounds for Eigenvalues of Markov Chains
inferredcites →https://doi.org/10.1214/aop/1176989682openalex-snapshot
Rough Large Deviation Estimates for Simulated Annealing: Application to Exponential Schedules
inferredcites →https://doi.org/10.1214/aop/1176991169openalex-snapshot
A Limit Theorem for a Class of Inhomogeneous Markov Processes
inferredcites →https://doi.org/10.1287/moor.13.2.311openalex-snapshot
Cooling Schedules for Optimal Annealing
inferredcites →https://doi.org/10.1287/moor.13.3.508openalex-snapshot
On Eigenvalues and Annealing Rates
inferredcites →https://doi.org/10.1287/moor.14.1.70openalex-snapshot
Markov Chains with Rare Transitions and Simulated Annealing
inferredcites →https://doi.org/10.1515/9781400869312-013openalex-snapshot
A Lower Bound for the Smallest Eigenvalue of the Laplacian
inferredcites →https://doi.org/10.2307/1427186openalex-snapshot
Convergence and finite-time behavior of simulated annealing
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
inferredcites →https://doi.org/10.2307/2982031openalex-snapshot
Non-Negative Matrices and Markov Chains.
inferredcites →https://doi.org/10.5555/318013.318030openalex-snapshot
A New Algorithm for Floorplan Design

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-48056-5_10openalex-snapshot
The Theory and Practice of Simulated Annealing
inferred← citeshttps://doi.org/10.1007/978-1-4615-1507-4_20openalex-snapshot
Analyzing the Performance of Local Search Algorithms Using Generalized Hill Climbing Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-30504-7_13openalex-snapshot
Theoretically Grounded Acceleration Techniques for Simulated Annealing
inferred← citeshttps://doi.org/10.1007/bf02823149openalex-snapshot
Stochastic approximation algorithms: Overview and recent trends
inferred← citeshttps://doi.org/10.1007/s10898-012-9860-0openalex-snapshot
From simulated annealing to stochastic continuation: a new trend in combinatorial optimization
inferred← citeshttps://doi.org/10.1007/s11009-005-1482-2openalex-snapshot
Performance Analysis of Cyclical Simulated Annealing Algorithms
inferred← citeshttps://doi.org/10.1023/a:1013544329096openalex-snapshot
Finite-Time Performance Analysis of Static Simulated Annealing Algorithms
inferred← citeshttps://doi.org/10.1023/a:1019633214895openalex-snapshot
Analysis of Static Simulated Annealing Algorithms
inferred← citeshttps://doi.org/10.1080/0952813x.2012.656327openalex-snapshot
Quantifying the exploration performed by metaheuristics
inferred← citeshttps://doi.org/10.1103/physreve.108.054119openalex-snapshot
Bound on annealing performance from stochastic thermodynamics, with application to simulated annealing
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.