GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem (Q336743): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2012.10.001 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2012.10.001 / rank | |||
Normal rank | |||
Latest revision as of 14:47, 9 December 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
0 references
0 references
0 references
0 references
