Heuristic combinatorial optimization by simulated Darwinian evolution: A polynomial time algorithm for the traveling salesman problem (Q757282)
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: Heuristic combinatorial optimization by simulated Darwinian evolution: A polynomial time algorithm for the traveling salesman problem |
scientific article; zbMATH DE number 4191452
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Heuristic combinatorial optimization by simulated Darwinian evolution: A polynomial time algorithm for the traveling salesman problem |
scientific article; zbMATH DE number 4191452 |
Statements
Heuristic combinatorial optimization by simulated Darwinian evolution: A polynomial time algorithm for the traveling salesman problem (English)
0 references
1991
0 references
genetic algorithm
0 references
Darwinian evolution
0 references
near-optimal solutions to the Traveling Salesman Problem
0 references
heuristic algorithm
0 references
natural selection
0 references
time complexity
0 references
fastest sorting scheme
0 references
0 references
0.7891502976417542
0 references
0.7794249057769775
0 references
0.7571390867233276
0 references
0.7541075348854065
0 references
0.7488332986831665
0 references
