TY - GEN A1 - Stoer, Mechthild A1 - Dahl, Geir T1 - A Polyhedral Approach to Multicommodity Survivable Network Design. N2 - The design of cost-efficient networks satisfying certain survivability constraints is of major concern to the telecommunications industry. In this paper we study a problem of extending the capacity of a network by discrete steps as cheaply as possible, such that the given traffic demand can be accommodated even when a single edge or node in the network fails. We derive valid and non-redundant inequalities for the polyhedron of capacity design variables, by exploiting its relationship to connectivity network design and knapsack-like subproblems. Computational work using this model and the additional inequalities is in progress. T3 - ZIB-Report - SC-93-20 Y1 - 1993 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-1162 ER - TY - GEN A1 - Dahl, Geir A1 - Martin, Alexander A1 - Stoer, Mechthild T1 - Routing through virtual paths in layered telecommunication networks N2 - We study a network configuration problem in telecommunications where one wants to set up paths in a capacitated network to accommodate given point-to-point traffic demand. The problem is formulated as an integer linear programming model where 0-1 variables represent different paths. An associated integral polytope is studied and different classes of facets are described. These results are used in a cutting plane algorithm. Computational results for some realistic problems are reported. T3 - ZIB-Report - SC-95-41 Y1 - 1995 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-2070 ER -