Upper and lower bounding strategies for the generalized minimum spanning tree problem (Q817552): 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.ejor.2004.07.072 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2023571729 / rank | |||
Normal rank | |||
Revision as of 22:22, 19 March 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
