Concentrator location in telecommunications networks.
type: Item
instance of: scholarly article
title: Concentrator location in telecommunications networks.
zbMATH Open document ID: 1083.90034
author: Hande Yaman
published in: Combinatorial Optimization
publication date: 2005-02-10T00:00:00Z
review text: 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.
reviewed by: Hartmut Noltemeier
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90-02
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 2133273
zbMATH Keywords: telecommunication network
zbMATH Keywords: concentrator location
zbMATH Keywords: location and network design
zbMATH Keywords: mixed integer programming
zbMATH Keywords: branch and cut algorithm
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 2133273