A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem (Q6090469)
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: A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem |
scientific article; zbMATH DE number 7767490
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem |
scientific article; zbMATH DE number 7767490 |
Statements
A GRASP with path‐relinking and restarts heuristic for the prize‐collecting generalized minimum spanning tree problem (English)
0 references
17 November 2023
0 references
prize-collecting generalized minimum spanning tree problem
0 references
generalized minimum spanning tree problem
0 references
GRASP
0 references
metaheuristics
0 references
randomized metaheuristics
0 references
path-relinking
0 references
restarts
0 references
time-to-target plots
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
