Hybrid nested partitions method for the traveling salesman problem (Q2963701)
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: Hybrid nested partitions method for the traveling salesman problem |
scientific article; zbMATH DE number 6687456
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hybrid nested partitions method for the traveling salesman problem |
scientific article; zbMATH DE number 6687456 |
Statements
Hybrid Nested Partitions Method for the Traveling Salesman Problem (English)
0 references
21 February 2017
0 references
nested partitions method
0 references
local search algorithm
0 references
Lin-Kernighan algorithm
0 references
3-opt algorithm
0 references
traveling salesman problem
0 references
0.8045210838317871
0 references
0.7596986293792725
0 references
0.7572470307350159
0 references
0.7556861042976379
0 references
0.7544491291046143
0 references
