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

Link

no authoritative link yet

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

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:ea6e5799e635 · see in the full table