No label defined (Q4817237)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2102010
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 2102010 |
Statements
22 September 2004
0 references
traveling salesman problem
0 references
0.8315784335136414
0 references
0.8112925887107849
0 references
0.7629244923591614
0 references
0.7615231275558472
0 references
0.7608001828193665
0 references
The given heuristic algorithm starts by coarsening the original problem \(P_0\) into a sequence \(P_1,\dots,P_m\) of smaller problems, two coarsening methods are described. In the following uncoarsening phase the tour found for \(P_m\) is projected back to the original problem by going through the problems \(P_{m-1},\dots, P_1\), here also two methods are considered. Some experimental results are discussed. For the entire collection see [Zbl 1028.00037].
0 references