TY - GEN A1 - Bley, Andreas T1 - Routing and Capacity Optimization for IP networks N2 - This article describes the main concepts and techniques that have been developed during the last year at ZIB to solve dimensioning and routing optimization problems for IP networks. We discuss the problem of deciding if a given path set corresponds to an unsplittable shortest path routing, the fundamental properties of such path sets, and the computational complexity of some basic network planning problems for this routing type. Then we describe an integer-linear programming approach to solve such problems in practice. This approach has been used successfully in the planning of the German national education and research network for several years. T3 - ZIB-Report - 07-33 KW - kombinatorische Optimierung KW - gemischt-ganzzahlige Programmierung KW - kürzeste-Wege Routing KW - Approximationsalgorithmen KW - combinatorial optimization KW - mixed-integer programming KW - shortest path routing KW - approximation algorithms Y1 - 2007 UR - https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/1032 UR - https://nbn-resolving.org/urn:nbn:de:0297-zib-10323 SN - 1438-0064 ER -