<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>3298</id>
    <completedYear>2009</completedYear>
    <publishedYear>2009</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>International Network Optimization Conference</publisherName>
    <publisherPlace>Pisa, Italy</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A packing integer program arising in two-layer network design</title>
    <parentTitle language="eng">Proceedings of the INOC 2009, Pisa, Italy</parentTitle>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Arie M.C.A. Koster</author>
    <author>C. Raack</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="projects" number="MATHEON-B3">MATHEON-B3</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>941</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2006-11-16</completedDate>
    <publishedDate>2006-11-16</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Two-layer Network Design by Branch-and-Cut featuring MIP-based Heuristics</title>
    <abstract language="eng">This paper deals with MIP-based primal heuristics to be used within a branch-and-cut approach for solving multi-layer telecommunication network design problems. Based on a mixed-integer programming formulation for two network layers, we present three heuristics for solving important subproblems, two of which solve a sub-MIP. On multi-layer planning instances with many parallel logical links, we show the effectiveness of our heuristics in finding good solutions early in the branch-and-cut search tree.</abstract>
    <identifier type="serial">06-47</identifier>
    <identifier type="opus3-id">941</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-9412</identifier>
    <enrichment key="SourceTitle">Appeared in: Proceedings International Network Optimization Conference, INOC 2007, Spa, Belgium.</enrichment>
    <author>Sebastian Orlowski</author>
    <author>Arie M.C.A. Koster</author>
    <author>Christian Raack</author>
    <author>Roland Wessäly</author>
    <series>
      <title>ZIB-Report</title>
      <number>06-47</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>multi-layer network design</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>integer programming</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>branch-and-cut</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>heuristics</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="msc" number="90B18">Communication networks [See also 68M10, 94A05]</collection>
    <collection role="msc" number="90C57">Polyhedral combinatorics, branch-and-bound, branch-and-cut</collection>
    <collection role="msc" number="90C59">Approximation methods and heuristics</collection>
    <collection role="institutes" number="">ZIB Allgemein</collection>
    <collection role="projects" number="BMBF-Eibone">BMBF-Eibone</collection>
    <collection role="projects" number="MATHEON-B3">MATHEON-B3</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/941/ZR_06_47.pub.elc.Vers.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/941/ZR-06-47.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/941/ZR-06-47.ps</file>
  </doc>
  <doc>
    <id>3295</id>
    <completedYear>2011</completedYear>
    <publishedYear>2011</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>141</pageFirst>
    <pageLast>156</pageLast>
    <pageNumber/>
    <edition/>
    <issue>2</issue>
    <volume>57</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">On cut-based inequalities for capacitated network design polyhedra</title>
    <parentTitle language="eng">Networks</parentTitle>
    <identifier type="url">http://onlinelibrary.wiley.com/doi/10.1002/net.20395/abstract</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Christian Raack</author>
    <author>Arie M.C.A. Koster</author>
    <author>Sebastian Orlowski</author>
    <author>Roland Wessäly</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>951</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-04-17</completedDate>
    <publishedDate>2007-04-17</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">On the strength of cut-based inequalities for capacitated network design polyhedra</title>
    <abstract language="eng">In this paper we study capacitated network design problems, differentiating directed, bidirected and undirected link capacity models. We complement existing polyhedral results for the three variants by new classes of facet-defining valid inequalities and unified lifting results. For this, we study the restriction of the problems to a cut of the network. First, we show that facets of the resulting cutset polyhedra translate into facets of the original network design polyhedra if the two subgraphs defined by the network cut are (strongly) connected. Second, we provide an analysis of the facial structure of cutset polyhedra, elaborating the differences caused by the three different types of capacity constraints. We present flow-cutset inequalities for all three models and show under which conditions these are facet-defining. We also state a new class of facets for the bidirected and undirected case and it is shown how to handle multiple capacity modules by Mixed Integer Rounding (MIR).</abstract>
    <identifier type="serial">07-08</identifier>
    <identifier type="opus3-id">951</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-9512</identifier>
    <author>Christian Raack</author>
    <author>Arie M.C.A. Koster</author>
    <author>Roland Wessäly</author>
    <series>
      <title>ZIB-Report</title>
      <number>07-08</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>cutset-polyhedra</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>flow-cutset inequalities</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>network design</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>mixed integer programming</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="msc" number="90B18">Communication networks [See also 68M10, 94A05]</collection>
    <collection role="msc" number="90C11">Mixed integer programming</collection>
    <collection role="msc" number="90C35">Programming involving graphs or networks [See also 90C27]</collection>
    <collection role="msc" number="90C57">Polyhedral combinatorics, branch-and-bound, branch-and-cut</collection>
    <collection role="institutes" number="">ZIB Allgemein</collection>
    <collection role="projects" number="BMBF-Eibone">BMBF-Eibone</collection>
    <collection role="projects" number="MATHEON-B3">MATHEON-B3</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/951/ZR_07_08.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/951/ZR-07-08.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/951/ZR_07_08.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/951/ZR-07-08.ps</file>
  </doc>
  <doc>
    <id>957</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-06-07</completedDate>
    <publishedDate>2007-06-07</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Capacitated network design using general flow-cutset inequalities</title>
    <abstract language="eng">This paper deals with directed, bidirected, and undirected capacitated network design problems. Using mixed integer rounding (MIR), we generalize flow-cutset inequalities to these three link types and to an arbitrary modular link capacity structure, and propose a generic separation algorithm. In an extensive computational study on 54 instances from the Survivable Network Design Library (SNDlib), we show that the performance of cplex can significantly be enhanced by this class of cutting planes. The computations reveal the particular importance of the subclass of cutset-inequalities.</abstract>
    <identifier type="serial">07-14</identifier>
    <identifier type="opus3-id">957</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-9576</identifier>
    <author>Christian Raack</author>
    <author>Arie M.C.A. Koster</author>
    <author>Sebastian Orlowski</author>
    <author>Roland Wessäly</author>
    <series>
      <title>ZIB-Report</title>
      <number>07-14</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>general flow-cutset inequalities</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>capacitated network design</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>mixed integer rounding</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>SNDlib</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="msc" number="90B18">Communication networks [See also 68M10, 94A05]</collection>
    <collection role="msc" number="90C11">Mixed integer programming</collection>
    <collection role="msc" number="90C35">Programming involving graphs or networks [See also 90C27]</collection>
    <collection role="msc" number="90C57">Polyhedral combinatorics, branch-and-bound, branch-and-cut</collection>
    <collection role="institutes" number="">ZIB Allgemein</collection>
    <collection role="projects" number="MATHEON-B3">MATHEON-B3</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/957/ZR-07-14.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/957/ZR-07-14.ps</file>
  </doc>
  <doc>
    <id>3305</id>
    <completedYear>2007</completedYear>
    <publishedYear>2007</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>International Network Optimization Conference</publisherName>
    <publisherPlace>Spa, Belgium</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Two-layer Network Design by Branch-and-Cut featuring MIP-based Heuristics</title>
    <parentTitle language="eng">Proceedings of the INOC 2007, Spa, Belgium, also ZIB Report ZR-06-47</parentTitle>
    <identifier type="url">http://www.zib.de/Publications/abstracts/ZR-06-47</identifier>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-9412</enrichment>
    <author>Sebastian Orlowski</author>
    <author>Arie M.C.A. Koster</author>
    <author>Christian Raack</author>
    <author>Roland Wessäly</author>
    <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>
  </doc>
  <doc>
    <id>3303</id>
    <completedYear>2007</completedYear>
    <publishedYear>2007</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>International Network Optimization Conference</publisherName>
    <publisherPlace>Spa, Belgium</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Capacitated network design using general flow-cutset inequalities</title>
    <parentTitle language="eng">Proceedings of the INOC 2007, Spa, Belgium, also ZIB Report ZR-07-14</parentTitle>
    <identifier type="url">http://www.zib.de/Publications/abstracts/ZR-07-14</identifier>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-9576</enrichment>
    <author>Christian Raack</author>
    <author>Arie M.C.A. Koster</author>
    <author>Sebastian Orlowski</author>
    <author>Roland Wessäly</author>
    <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>
  </doc>
  <doc>
    <id>3304</id>
    <completedYear>2008</completedYear>
    <publishedYear>2008</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1</pageFirst>
    <pageLast>23</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>bookpart</type>
    <publisherName>Springer</publisherName>
    <publisherPlace>College Park, MD, U.S.A.</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Single-layer Cuts for Multi-Layer Network Design Problems</title>
    <parentTitle language="eng">Telecommunications Modeling Policy and Technology, also ZIB Report ZR-07-21</parentTitle>
    <identifier type="url">http://dx.doi.org/10.1007/978-0-387-77780-1_1</identifier>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-9641</enrichment>
    <author>Arie M.C.A. Koster</author>
    <author>Sebastian Orlowski</author>
    <author>Christian Raack</author>
    <author>Georg Baier</author>
    <author>Thomas Engel</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>3300</id>
    <completedYear>2009</completedYear>
    <publishedYear>2009</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>95</pageFirst>
    <pageLast>118</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>bookpart</type>
    <publisherName>Springer Berlin Heidelberg</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Branch-and-cut techniques for solving realistic two-layer network design problems</title>
    <parentTitle language="eng">Graphs and Algorithms in Communication Networks</parentTitle>
    <identifier type="url">http://www.springerlink.com/content/g3rt54x5w4110240</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Arie M.C.A. Koster</author>
    <author>Sebastian Orlowski</author>
    <author>Christian Raack</author>
    <author>Georg Baier</author>
    <author>Thomas Engel</author>
    <author>Pietro Belotti</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="projects" number="BMBF-Eibone">BMBF-Eibone</collection>
    <collection role="projects" number="MATHEON-B3">MATHEON-B3</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>3294</id>
    <completedYear>2010</completedYear>
    <publishedYear>2010</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>Next Generation Internet</publisherName>
    <publisherPlace>Paris, France</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Towards Robust Network Design using Integer Linear Programming Techniques</title>
    <parentTitle language="eng">Proceedings of the NGI 2010, Paris, France</parentTitle>
    <identifier type="url">http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5534462</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Arie M.C.A. Koster</author>
    <author>Manuel Kutschka</author>
    <author>Christian Raack</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="projects" number="MATHEON-B3">MATHEON-B3</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>964</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-08-13</completedDate>
    <publishedDate>2007-08-13</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Single-layer Cuts for Multi-layer Network Design Problems</title>
    <abstract language="eng">We study a planning problem arising in SDH/WDM multi-layer telecommunication network design. The goal is to find a minimum cost installation of link and node hardware of both network layers such that traffic demands can be realized via grooming and a survivable routing. We present a mixed-integer programming formulation that takes many practical side constraints into account, including node hardware, several bitrates, and survivability against single physical node or link failures. This model is solved using a branch-and-cut approach with problem-specific preprocessing and cutting planes based on either of the two layers. On several realistic two-layer planning scenarios, we show that these cutting planes are still useful in the multi-layer context, helping to increase the dual bound and to reduce the optimality gaps.</abstract>
    <identifier type="serial">07-21</identifier>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="opus3-id">975</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-9641</identifier>
    <enrichment key="SourceTitle">Appeared in: Telecommunications Modeling, Policy, and Technology. S. Raghavan et al. (eds.) Springer 2008. ISBN 978-0-387-77779-5, pp. 1-23</enrichment>
    <author>Arie M.C.A. Koster</author>
    <submitter>unknown unknown</submitter>
    <author>Sebastian Orlowski</author>
    <author>Christian Raack</author>
    <author>Georg Bayer</author>
    <author>Thomas Engel</author>
    <series>
      <title>ZIB-Report</title>
      <number>07-21</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>telecommunication network</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>multi-layer network design</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>mixed-integer programming</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>cutting planes</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="msc" number="68M10">Network design and communication [See also 68R10, 90B18]</collection>
    <collection role="msc" number="90B18">Communication networks [See also 68M10, 94A05]</collection>
    <collection role="msc" number="90C57">Polyhedral combinatorics, branch-and-bound, branch-and-cut</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="projects" number="MATHEON-B3">MATHEON-B3</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/964/ZR_07_21.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/964/ZR_07_21.ps</file>
  </doc>
  <doc>
    <id>1389</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2011-09-01</completedDate>
    <publishedDate>2011-09-01</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Robust Network Design: Formulations, Valid Inequalities, and Computations</title>
    <abstract language="eng">Traffic in communication networks fluctuates heavily over time.&#13;
  Thus, to avoid capacity bottlenecks, operators highly overestimate&#13;
  the traffic volume during network planning. In this paper we&#13;
  consider telecommunication network design under traffic uncertainty,&#13;
  adapting the robust optimization approach of Bertsimas and Sim [2004]. We&#13;
  present three different mathematical formulations for this problem,&#13;
  provide valid inequalities, study the computational implications,&#13;
  and evaluate the realized robustness.&#13;
&#13;
  To enhance the performance of the mixed-integer programming solver&#13;
  we derive robust cutset inequalities generalizing their&#13;
  deterministic counterparts. Instead of a single cutset inequality&#13;
  for every network cut, we derive multiple valid&#13;
  inequalities by exploiting the extra variables available in the&#13;
  robust formulations. We show that these inequalities define facets&#13;
  under certain conditions and that they completely describe a projection&#13;
  of the robust cutset polyhedron if the cutset consists of a single edge.&#13;
&#13;
  For realistic networks and live traffic measurements we compare the&#13;
  formulations and report on the speed up by the valid inequalities.&#13;
  We study the "price of robustness" and evaluate the&#13;
  approach by analyzing the real network load. The results show that&#13;
  the robust optimization approach has the potential to support&#13;
  network planners better than present methods.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="serial">11-34</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-13890</identifier>
    <author>Arie M.C.A. Koster</author>
    <submitter>Christian Raack</submitter>
    <author>Manuel Kutschka</author>
    <author>Christian Raack</author>
    <series>
      <title>ZIB-Report</title>
      <number>11-34</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>robust network design</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>cutset inequalities</value>
    </subject>
    <collection role="msc" number="90Bxx">Operations research and management science</collection>
    <collection role="msc" number="90B18">Communication networks [See also 68M10, 94A05]</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="projects" number="MATHEON-B3">MATHEON-B3</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1389/20110901-ZIB-Report-11-34.pdf</file>
  </doc>
</export-example>
