| Article ID: | iaor1999355 |
| Country: | Netherlands |
| Volume: | 92 |
| Issue: | 1 |
| Start Page Number: | 214 |
| End Page Number: | 216 |
| Publication Date: | Jul 1996 |
| Journal: | European Journal of Operational Research |
| Authors: | Volgenant A., Duin C.W. |
| Keywords: | minimum spanning trees |
The hierarchical network design problem is the problem to find a spanning tree of minimum total weight, when the edges of the path between two given nodes are weighted by another cost function than the tree edges not on this path. We point out that a dynamic programming oriented heuristic can already be found in literature. Further we report on possible extensions and improvements.