On the public citation graph
Simulated Annealing Type Markov Chains and Their Order Balance Equations
0 signed · 29 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/bf01007975openalex-snapshot
Nonstationary Markov chains and convergence of the annealing algorithm
inferredcites →https://doi.org/10.1016/c2009-0-22097-6openalex-snapshot
A Course in Probability Theory
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.1109/tpami.1984.4767596openalex-snapshot
Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
inferredcites →https://doi.org/10.1287/moor.13.2.311openalex-snapshot
Cooling Schedules for Optimal Annealing
inferredcites →https://doi.org/10.2307/1427186openalex-snapshot
Convergence and finite-time behavior of simulated annealing
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-4612-2920-9_8openalex-snapshot
Some Limit Theorems on Simulated Annealing
inferred← citeshttps://doi.org/10.1007/bfb0007063openalex-snapshot
Partially parallel simulated annealing: Low and high temperature approach of the invariante measure
inferred← citeshttps://doi.org/10.1017/s0021900200043230openalex-snapshot
Pathwise recurrence orders and simulated annealing
inferred← citeshttps://doi.org/10.1017/s0021900200103341openalex-snapshot
Tail events of simulated annealing Markov chains
inferred← citeshttps://doi.org/10.1017/s0269964800003168openalex-snapshot
Quasi-Statically Cooled Markov Chains
inferred← citeshttps://doi.org/10.1109/9.940936openalex-snapshot
A convergence analysis of generalized hill climbing algorithms
inferred← citeshttps://doi.org/10.1109/allerton.2018.8635910openalex-snapshot
Simulated Annealing for Optimal Resource Allocation in Wireless Networks with Imperfect Communications
inferred← citeshttps://doi.org/10.1109/cdc.1992.371616openalex-snapshot
Stochastic comparison algorithm for discrete optimization with estimation
inferred← citeshttps://doi.org/10.1109/cdc.2005.1583226openalex-snapshot
Relative Frequencies of Non-homogeneous Markov Chains in Simulated Annealing and Related Algorithms
inferred← citeshttps://doi.org/10.1109/tmc.2022.3154089openalex-snapshot
Joint Traffic Offloading and Aging Control in 5G IoT Networks
inferred← citeshttps://doi.org/10.1109/tnet.2021.3100757openalex-snapshot
A Swiss Army Knife for Online Caching in Small Cell Networks
inferred← citeshttps://doi.org/10.1137/0329008openalex-snapshot
Note on the Convergence of Simulated Annealing Algorithms
inferred← citeshttps://doi.org/10.1137/0331009openalex-snapshot
Metropolis-Type Annealing Algorithms for Global Optimization in $\mathbb{R}^d $
inferred← citeshttps://doi.org/10.1137/s0363012991197171openalex-snapshot
Asymptotic First Hitting-Time Distribution of Annealing Processes
inferred← citeshttps://doi.org/10.1137/s1052623495290684openalex-snapshot
Stochastic Comparison Algorithm for Discrete Optimization with Estimation
inferred← citeshttps://doi.org/10.1214/aoap/1177004607openalex-snapshot
Probabilistic Search with Overrides
inferred← citeshttps://doi.org/10.1214/aoap/1177004840openalex-snapshot
Tail Events of some Nonhomogeneous Markov Chains
inferred← citeshttps://doi.org/10.1287/moor.1050.0177openalex-snapshot
Relative Frequencies of Generalized Simulated Annealing
inferred← citeshttps://doi.org/10.4064/am-26-4-395-414openalex-snapshot
Directed forests with application to algorithms related to Markov chains
inferred← citeshttps://doi.org/10.48550/arxiv.1901.10763openalex-snapshot
An approximate Itô-SDE based simulated annealing algorithm for multivariate design optimization problems
inferred← citeshttps://doi.org/10.48550/arxiv.1912.10149openalex-snapshot
A Swiss Army Knife for Dynamic Caching in Small Cell Networks
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.