Upper and lower bounding strategies for the generalized minimum spanning tree problem (Q817552)
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: Upper and lower bounding strategies for the generalized minimum spanning tree problem |
scientific article; zbMATH DE number 5012929
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper and lower bounding strategies for the generalized minimum spanning tree problem |
scientific article; zbMATH DE number 5012929 |
Statements
Upper and lower bounding strategies for the generalized minimum spanning tree problem (English)
0 references
16 March 2006
0 references
generalized minimum spanning tree
0 references
Steiner tree
0 references
randomized greedy heuristic
0 references
genetic algorithm
0 references
Lagrangian relaxation
0 references
0 references
0 references
0 references
0.9131823182106018
0 references
0.8879583477973938
0 references
0.885763943195343
0 references
0.8801426291465759
0 references
