ACO algorithms with guaranteed convergence to the optimal solution (Q1603542): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3994799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new rank based version of the ant system. -- A computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the analysis of the \((1+1)\) evolutionary algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cooling Schedules for Optimal Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-negative matrices and Markov chains. 2nd ed / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(01)00258-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048910294 / rank
 
Normal rank

Latest revision as of 08:58, 30 July 2024

scientific article
Language Label Description Also known as
English
ACO algorithms with guaranteed convergence to the optimal solution
scientific article

    Statements

    ACO algorithms with guaranteed convergence to the optimal solution (English)
    0 references
    0 references
    14 July 2002
    0 references
    analysis of algorithms
    0 references
    ant Colony Optimization
    0 references
    combinatorial problems
    0 references
    convergence
    0 references
    heuristic optimization
    0 references
    randomized algorithms
    0 references

    Identifiers