GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem (Q336743): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cor.2012.10.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2031673408 / rank | |||
Normal rank | |||
Revision as of 20:53, 19 March 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
