A running time analysis of an ant colony optimization algorithm for shortest paths in directed acyclic graphs (Q2380048)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A running time analysis of an ant colony optimization algorithm for shortest paths in directed acyclic graphs |
scientific article; zbMATH DE number 5686478
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A running time analysis of an ant colony optimization algorithm for shortest paths in directed acyclic graphs |
scientific article; zbMATH DE number 5686478 |
Statements
A running time analysis of an ant colony optimization algorithm for shortest paths in directed acyclic graphs (English)
0 references
24 March 2010
0 references
analysis of algorithms
0 references
graph algorithms
0 references
ant colony optimization
0 references
shortest paths
0 references
0.880131721496582
0 references
0.8382596373558044
0 references
0.829339861869812
0 references
0.8182570338249207
0 references
0.8176116347312927
0 references
