A GRASP heuristic using path-relinking and restarts for the Steiner traveling salesman problem (Q4601628)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6829118
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A GRASP heuristic using path-relinking and restarts for the Steiner traveling salesman problem |
scientific article; zbMATH DE number 6829118 |
Statements
A GRASP heuristic using path‐relinking and restarts for the Steiner traveling salesman problem (English)
0 references
24 January 2018
0 references
Steiner traveling salesman problem
0 references
traveling salesman problem
0 references
GRASP
0 references
path-relinking
0 references
restarts
0 references
0.8009582161903381
0 references
0.7944102883338928
0 references
0.7941566109657288
0 references
0.7900585532188416
0 references
