Simulated annealing algorithms for continuous global optimization

Locatelli, M. (2000). Simulated annealing algorithms for continuous global optimization: Convergence conditions. Journal of Optimization Theory and Applications, 104(1), 121-133.

Type

Journal article

Intellectual base

Primary research

Year

2000

Volume

104

Issue

1

Pages

121-133

Link

https://doi.org/10.1023/a:1004680806815 not authoritativefound

Cited from

operations_research

Cited by

1 citation across 1 artifact.

Each citation links to the sentence it supports in the citing article.

Primes

• Simulated Annealing
  • Structural distinctions include: discrete vs continuous variants (the algorithm applies to both, with different neighborhood structures

    This sourceFormalizes convergence conditions for simulated annealing on continuous (rather than combinatorial) optimization problems, addressing neighborhood-structure differences between discrete and continuous variants.

Verification

Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:ea6e5799e635 · see in the full table