ACO algorithms with guaranteed convergence to the optimal solution (Q1603542): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 | |||
Revision as of 11:48, 4 June 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
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
