Upper and lower bounding strategies for the generalized minimum spanning tree problem (Q817552): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:06, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper and lower bounding strategies for the generalized minimum spanning tree problem |
scientific article |
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
