The complexity of the optimal recombination for the traveling salesman problem (Q3115247)
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: The complexity of the optimal recombination for the traveling salesman problem |
scientific article; zbMATH DE number 6007885
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of the optimal recombination for the traveling salesman problem |
scientific article; zbMATH DE number 6007885 |
Statements
20 February 2012
0 references
traveling salesman problem
0 references
genetic algorithm
0 references
optimal recombination
0 references
computational complexity
0 references
problem transformation
0 references
0.8617265820503235
0 references
0.829106330871582
0 references
0.8181493282318115
0 references
0.8179736733436584
0 references
