TY - GEN
A1 - Alevras, Dimitris
A1 - GrÃ¶tschel, Martin
A1 - WessÃ¤ly, Roland
T1 - Cost-Efficient Network Synthesis from Leased Lines
N2 - Given a communication demand between each pair of nodes of a network we consider the problem of deciding what capacity to install on each edge of the network in order to minimize the building cost of the network and to satisfy the demand between each pair of nodes. The feasible capacities that can be leased from a network provider are of a particular kind in our case. There are a few so-called basic capacities having the property that every basic capacity is an integral multiple of every smaller basic capacity. An edge can be equipped with a capacity only if it is an integer combination of the basic capacities. We treat, in addition, several restrictions on the routings of the demands (length restriction, diversification) and failures of single nodes or single edges. We formulate the problem as a mixed integer linear programming problem and develop a cutting plane algorithm as well as several heuristics to solve it. We report on computational results for real world data.
T3 - ZIB-Report - SC-97-22
Y1 - 1997
UR - https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/291
UR - https://nbn-resolving.org/urn:nbn:de:0297-zib-2912
ER -