Nonoblivious 2-opt heuristics for the traveling salesman problem (Q2811309)
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: Nonoblivious 2-opt heuristics for the traveling salesman problem |
scientific article; zbMATH DE number 6591791
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nonoblivious 2-opt heuristics for the traveling salesman problem |
scientific article; zbMATH DE number 6591791 |
Statements
10 June 2016
0 references
TSP
0 references
2-opt
0 references
local search
0 references
heuristics
0 references
performance guarantees
0 references
approximation algorithms
0 references
0 references
0 references
Nonoblivious 2-opt heuristics for the traveling salesman problem (English)
0 references
