| Article ID: | iaor19921763 |
| Country: | Switzerland |
| Volume: | 36 |
| Issue: | 1 |
| Start Page Number: | 347 |
| End Page Number: | 364 |
| Publication Date: | May 1992 |
| Journal: | Annals of Operations Research |
| Authors: | Qiu Yuping, Kuehner Warren, Parrish Scott H., Cox Tony |
| Keywords: | networks, programming: integer |
The authors report a new heuristic algorithm useful for developing least-cost expansion plans for leased telecommunications networks in which there is a hierarchy of possible transmission facilities. The problem combines network topolgoy design and capacity expansion problems. Implemented on a PC, the algorithm has successfully developed topology growth plans for twenty periods on networks with up to 31 nodes.