Upper and lower bounding strategies for the generalized minimum spanning tree problem (Q817552): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ejor.2004.07.072 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.EJOR.2004.07.072 / rank | |||
Normal rank | |||
Revision as of 09:58, 9 December 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
0 references
0 references
0 references
