<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>1032</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2007-11-09</completedDate>
    <publishedDate>2007-11-09</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Routing and Capacity Optimization for IP networks</title>
    <abstract language="eng">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.</abstract>
    <identifier type="serial">07-33</identifier>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="opus3-id">1062</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-10323</identifier>
    <enrichment key="SourceTitle">Appeared in: Operations Research Proceedings 2007. J. Kalcsics, S. Nickel (eds.) Springer 2008, pp. 9-16</enrichment>
    <author>Andreas Bley</author>
    <submitter>unknown unknown</submitter>
    <series>
      <title>ZIB-Report</title>
      <number>07-33</number>
    </series>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>kombinatorische Optimierung</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>gemischt-ganzzahlige Programmierung</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>kürzeste-Wege Routing</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Approximationsalgorithmen</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>combinatorial optimization</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>mixed-integer programming</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>shortest path routing</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>approximation algorithms</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="msc" number="90-02">Research exposition (monographs, survey articles)</collection>
    <collection role="msc" number="90C27">Combinatorial optimization</collection>
    <collection role="msc" number="90C57">Polyhedral combinatorics, branch-and-bound, branch-and-cut</collection>
    <collection role="msc" number="90C90">Applications of mathematical programming</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="projects" number="BMBF-Eibone">BMBF-Eibone</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1032/zib_preprint.pdf</file>
  </doc>
</export-example>
