Union search: a new meta-heuristic algorithm to the traveling salesman problem (Q3371046)
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: Union search: a new meta-heuristic algorithm to the traveling salesman problem |
scientific article; zbMATH DE number 5008101
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Union search: a new meta-heuristic algorithm to the traveling salesman problem |
scientific article; zbMATH DE number 5008101 |
Statements
21 February 2006
0 references
candidate set
0 references
statistic model
0 references
union search
0 references
traveling salesman problem
0 references
combinatorial optimization
0 references
0.7581136226654053
0 references
0.7542089819908142
0 references
0.7522347569465637
0 references
0.7484303712844849
0 references
