GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem (Q336743): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: TTTPLOTS / rank | |||
Normal rank | |||
Revision as of 02:55, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem |
scientific article |
Statements
GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem (English)
0 references
10 November 2016
0 references
combinatorial optimization
0 references
clustered traveling salesman problem
0 references
heuristics
0 references
path relinking
0 references
GRASP
0 references
