Convergence of an annealing algorithm (Q3703588)

From MaRDI portal
Revision as of 10:02, 17 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Convergence of an annealing algorithm
scientific article

    Statements

    title
    Convergence of an annealing algorithm (English)
    0 references
    DOI
    10.1007/BF01582166
    0 references
    publication date
    1986
    0 references
    zbMATH DE Number
    3930724
    0 references
    zbMATH Keywords
    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
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3703588&oldid=34726982"
    Powered by MediaWiki