Convergence of an annealing algorithm (Q3703588): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3943082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4745163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3970132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3855869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-negative matrices and Markov chains. 2nd ed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5657944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of iterations of local improvement algorithms / rank
 
Normal rank

Latest revision as of 10:02, 17 June 2024

scientific article
Language Label Description Also known as
English
Convergence of an annealing algorithm
scientific article

    Statements

    Convergence of an annealing algorithm (English)
    0 references
    0 references
    1986
    0 references
    0 references
    global optimization
    0 references
    metropolis method
    0 references
    hill climbing
    0 references
    local improvement
    0 references
    annealing algorithm
    0 references
    stochastic optimization
    0 references
    NP-hard combinatorial problems
    0 references
    travelling salesman
    0 references
    Steiner trees
    0 references
    convergence rate
    0 references