| Article ID: | iaor1996700 |
| Country: | Netherlands |
| Volume: | 62 |
| Issue: | 1 |
| Start Page Number: | 105 |
| End Page Number: | 115 |
| Publication Date: | Oct 1992 |
| Journal: | European Journal of Operational Research |
| Authors: | Tcha Dong-wan, Myung Young-soo, Chung Sung-hark |
| Keywords: | networks, programming: integer, programming: quadratic |
This paper deals with the topological design of a network with a two-level hierarchical structure where the embedded backbone network is full-meshed and the local networks attached to it are of star type. The whole problem, unlike the conventional approaches partitioning it into two subproblems, is directly handled in such a general setting that both a backbone network and local access networks are to be simultaneously determined. The authors formulate this problem as a quadratic 0-1 programming model, and also propose an equivalent linearized version of the model. Based on the observation that the linearized model is a variant of the well established uncapacitated facilty location problem, a dual-based solution procedure is developed and shown to be efficient from computing experiments which were done on a wide variety of problems with up to 50 backbone nodes and 50 user nodes.