Two multi-start heuristics for the \(k\)-traveling salesman problem (Q2656560)
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: Two multi-start heuristics for the k-traveling salesman problem |
scientific article; zbMATH DE number 7319774
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two multi-start heuristics for the \(k\)-traveling salesman problem |
scientific article; zbMATH DE number 7319774 |
Statements
Two multi-start heuristics for the \(k\)-traveling salesman problem (English)
0 references
11 March 2021
0 references
\(k\)-traveling salesman problem
0 references
traveling salesman problem
0 references
general variable neighborhood search
0 references
hyper-heuristic
0 references
heuristic
0 references
0 references
0 references
0 references
0 references
0.7896701097488403
0 references
0.7439175844192505
0 references
0.7423832416534424
0 references
0.7408266067504883
0 references
