Concentrator location in telecommunications networks. (Q1762564): Difference between revisions

The book provides a collection of results on concentrator location problems in telecommunication networks. A network is given as an edge weighted graph together with a traffic matrix denoting the desired communication traffic between pairs of nodes. A valid concentrator selection is a subset of the nodes with the property that each node is either selected or adjacent to a selected node. The goal is to find a concentrator selection of minimum cost, where costs arise both for opening a concentrator node, connecting the backbone network of concentrator nodes, and routing the traffic according to the traffic matrix. The author investigates several variants of the problem, including restrictions on the traffic capacity of concentrator nodes, and on the topology of the backbone network (star, complete graph). By examining the structure of the associated polyhedra she develops branch and cut algorithms for solving the variants. The work is justified by computational results.