Algorithmic strategies for a fast exploration of the TSP 4-OPT neighborhood (Q2216018)
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 7285660
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic strategies for a fast exploration of the TSP 4-OPT neighborhood |
scientific article; zbMATH DE number 7285660 |
Statements
Algorithmic strategies for a fast exploration of the TSP 4-OPT neighborhood (English)
0 references
15 December 2020
0 references
traveling salesman problem
0 references
local search
0 references
\(K\)-opt neighborhood
0 references
0.8737382292747498
0 references
0.7920053601264954
0 references
0.7866382598876953
0 references
0.7866382598876953
0 references
