AN ALGORITHM FOR HIERARCHICAL NETWORK DESIGN
提出一种三阶段算法，先定位集中器，再优化其子网络拓扑，最后连接集中器到根节点，并在三个中等城市数据上测试。
We consider the network design problem of locating a set of concentrators which serves a set of customers with known demands. The uncapacitated facility location model is applied to locate the concentrators. Then, for each concentrator we analyze a topological optimization of its subnetwork based on a simple heuristic. In a third phase, we apply the last model to solve the upper level subnetwork connecting the concentrators to a root node. Computational results are reported for three medium- sized cities.