<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>3276</id>
    <completedYear>2003</completedYear>
    <publishedYear>2003</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>report</type>
    <publisherName>MOMENTUM</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Describing UMTS Radio Networks using XML</title>
    <author>Andreas Eisenblätter</author>
    <author>Hans-Florian Geerdes</author>
    <author>Thorsten Koch</author>
    <author>Ulrich Türke</author>
    <collection role="persons" number="koch">Koch, Thorsten</collection>
  </doc>
  <doc>
    <id>3277</id>
    <completedYear>2003</completedYear>
    <publishedYear>2003</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue>TD(03) 167</issue>
    <volume/>
    <type>report</type>
    <publisherName>COST 273</publisherName>
    <publisherPlace>Prague, Czech Republic</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">MOMENTUM Public Planning Scenarios and their XML Format</title>
    <author>Andreas Eisenblätter</author>
    <author>Hans-Florian Geerdes</author>
    <author>Thorsten Koch</author>
    <author>Ulrich Türke</author>
    <collection role="persons" number="koch">Koch, Thorsten</collection>
  </doc>
  <doc>
    <id>3244</id>
    <completedYear>2003</completedYear>
    <publishedYear>2003</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>Kluver</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Modelling Feasible Network Configurations for UMTS</title>
    <parentTitle language="eng">Telecommunications Network Design and Management</parentTitle>
    <identifier type="url">http://opus.kobv.de/zib/volltexte/2002/684/</identifier>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-6837</enrichment>
    <author>Andreas Eisenblätter</author>
    <editor>G. Anandalingam</editor>
    <editor>S. Raghavan</editor>
    <author>Thorsten Koch</author>
    <author>Alexander Martin</author>
    <author>Tobias Achterberg</author>
    <author>Armin Fügenschuh</author>
    <author>Arie M.C.A. Koster</author>
    <author>Oliver Wegel</author>
    <author>Roland Wessäly</author>
    <collection role="persons" number="achterberg">Achterberg, Tobias</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="persons" number="koch">Koch, Thorsten</collection>
  </doc>
  <doc>
    <id>3246</id>
    <completedYear>2003</completedYear>
    <publishedYear>2003</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>31</pageFirst>
    <pageLast>38</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>Springer</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Optimisation Methods for UMTS Radio Network Planning</title>
    <parentTitle language="eng">Operation Research Proceedings 2003</parentTitle>
    <identifier type="doi">10.1007/978-3-642-17022-5_5</identifier>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-7637</enrichment>
    <author>Andreas Eisenblätter</author>
    <editor>Dino Ahr</editor>
    <author>Armin Fügenschuh</author>
    <editor>Roland Fahrion</editor>
    <author>Hans-Florian Geerdes</author>
    <editor>Marcus Oswald</editor>
    <author>Daniel Junglas</author>
    <editor>Gerhard Reinelt</editor>
    <author>Thorsten Koch</author>
    <author>Alexander Martin</author>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="persons" number="koch">Koch, Thorsten</collection>
  </doc>
  <doc>
    <id>296</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>1997-06-20</completedDate>
    <publishedDate>1997-06-20</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Frequency Assignment Problem in Cellular Phone Networks</title>
    <abstract language="eng">We present a mathematical formulation of a \emph{frequency assignment problem} encountered in cellular phone networks: frequencies have to be assigned to stationary transceivers (carriers) such that as little interference as possible is induced while obeying several technical and legal restrictions. The optimization problem is NP-hard, and no good approximation can be guaranteed---unless P = NP. We sketch some starting and improvement heuristics, and report on their successful application for solving the frequency assignment problem under consideration. Computational results on real-world instances with up to 2877 carriers and 50 frequencies are presented.</abstract>
    <identifier type="serial">SC-97-27</identifier>
    <identifier type="opus3-id">297</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-2965</identifier>
    <enrichment key="SourceTitle">Appeared in: Network design: connectivity and facilities location. P. M. Pardalos, D. Du (eds.) Providence, RI: American Mathematical Society 1998. DIMACS series in discrete mathematics and theoretical computer science, 40. Pp. 109-115</enrichment>
    <author>Andreas Eisenblätter</author>
    <series>
      <title>ZIB-Report</title>
      <number>SC-97-27</number>
    </series>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="institutes" number="">ZIB Allgemein</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/296/SC-97-27.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/296/SC-97-27.pdf</file>
  </doc>
  <doc>
    <id>304</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>1997-07-11</completedDate>
    <publishedDate>1997-07-11</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Frequency Assignment in Cellular Phone Networks</title>
    <abstract language="eng">We present a graph-theoretic model for the \emph{frequency assignment problem} in Cellular Phone Networks: Obeying several technical and legal restrictions, frequencies have to be assigned to transceivers so that interference is as small as possible. This optimization problem is NP-hard. Good approximation cannot be guaranteed, unless P = NP. We describe several assignment heuristics. These heuristics are simple and not too hard to implement. We give an assessment of the heuristics' efficiency and practical usefulness. For this purpose, typical instances of frequency assignment problems with up to 4240 transceivers and 75 frequencies of a German cellular phone network operator are used. The results are satisfying from a practitioner's point of view. The best performing heuristics were integrated into a network planning system used in practice.</abstract>
    <identifier type="serial">SC-97-35</identifier>
    <identifier type="opus3-id">305</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-3044</identifier>
    <identifier type="doi">10.1023/A:1018908907763</identifier>
    <enrichment key="SourceTitle">Appeared in: Annals of OR 76 (1998), 73-93</enrichment>
    <author>Ralf Borndörfer</author>
    <author>Andreas Eisenblätter</author>
    <author>Martin Grötschel</author>
    <author>Alexander Martin</author>
    <series>
      <title>ZIB-Report</title>
      <number>SC-97-35</number>
    </series>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="institutes" number="">ZIB Allgemein</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="persons" number="groetschel">Grötschel, Martin</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/304/SC-97-35.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/304/SC-97-35.pdf</file>
  </doc>
  <doc>
    <id>717</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2002-12-19</completedDate>
    <publishedDate>2002-12-19</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Load Balancing in Signaling Transfer Points</title>
    <abstract language="eng">Signaling is crucial to the operation of modern telecommunication networks. A breakdown in the signaling infrastructure typically causes customer service failures, incurs revenue losses, and hampers the company image. Therefore, the signaling network has to be highest reliability and survivability. This in particular holds for the routers in such a network, called \textit{signaling transfer points\/} (STPs). The robustness of an STP can be improved by equally distributing the load over the internal processing units. Several constraints have to be taken into account. The load of the links connected to a processing unit changes over time introducing an imbalance of the load. In this paper, we show how integer linear programming can be applied to reduce the imbalance within an STP, while keeping the number of changes small. Two alternative models are presented. Computational experiments validate the integer programming approach in practice. The GSM network operator E-Plus saves substantial amounts of time and money by employing the proposed approach.</abstract>
    <identifier type="serial">02-50</identifier>
    <identifier type="opus3-id">718</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-7179</identifier>
    <author>Andreas Eisenblätter</author>
    <author>Arie M.C.A. Koster</author>
    <author>Randolf Wallbaum</author>
    <author>Roland Wessäly</author>
    <series>
      <title>ZIB-Report</title>
      <number>02-50</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Signaling network</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>STP</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>load-balancing</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>integer programming</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>computations</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="90C10">Integer programming</collection>
    <collection role="msc" number="90C90">Applications of mathematical programming</collection>
    <collection role="institutes" number="">ZIB Allgemein</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/717/ZR-02-50.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/717/ZR-02-50.pdf</file>
  </doc>
  <doc>
    <id>683</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2002-04-02</completedDate>
    <publishedDate>2002-04-02</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Modelling Feasible Network Configurations for UMTS</title>
    <abstract language="eng">A model for the optimisation of the location and configuration of base stations in a UMTS network is described. The focus is primarily on modelling the configuration problem sufficiently accurate using mixed-integer variables and (essentially) linear constraints. These constraints reflect the limited downlink code capacity in each cell, the interference limitations for successful up- and downlink transmissions, the need for sufficiently strong (cell) pilot signals, and the potential gain for mobiles from being in soft(er) hand-over. It is also explained how to use the model as a basis for rating network configurations.</abstract>
    <identifier type="serial">02-16</identifier>
    <identifier type="opus3-id">684</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-6837</identifier>
    <enrichment key="SourceTitle">Appeared in: Telecommunications Network Design and Management. G. Anandalingam, S. Raghavan (eds.) Boston: Kluwer Academic Publ. 2002. ISBN 1-4020-7318-6, pp. 1-24</enrichment>
    <author>Andreas Eisenblätter</author>
    <author>Armin Fügenschuh</author>
    <author>Thorsten Koch</author>
    <author>Arie M.C.A. Koster</author>
    <author>Alexander Martin</author>
    <author>Tobias Pfender</author>
    <author>Oliver Wegel</author>
    <author>Roland Wessäly</author>
    <series>
      <title>ZIB-Report</title>
      <number>02-16</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>UMTS</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>radio interface</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>network planning</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>configuration</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>perfect power control</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>mathematical model</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>mixed integer programming</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>MOMENTUM</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>IST-20</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="institutes" number="">ZIB Allgemein</collection>
    <collection role="persons" number="achterberg">Achterberg, Tobias</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="persons" number="koch">Koch, Thorsten</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/683/ZR-02-16.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/683/ZR-02-16.pdf</file>
  </doc>
  <doc>
    <id>763</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2003-12-03</completedDate>
    <publishedDate>2003-12-03</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Optimization Methods for UMTS Radio Network Planning</title>
    <abstract language="eng">The UMTS radio network planning problem poses the challenge of designing a cost-effective network that provides users with sufficient coverage and capacity. We describe an optimization model for this problem that is based on comprehensive planning data of the EU project MOMENTUM. We present heuristic mathematical methods for this realistic model, including computational results.</abstract>
    <identifier type="serial">03-41</identifier>
    <identifier type="opus3-id">764</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-7637</identifier>
    <enrichment key="SourceTitle">Appeared in: Operation Research Proceedings 2003, pp. 31-38, D. Ahr, R. Fahrion, M. Oswald and G. Reinelt (eds.), Springer, ISBN 3-540-41445-3</enrichment>
    <author>Andreas Eisenblätter</author>
    <author>Armin Fügenschuh</author>
    <author>Hans-Florian Geerdes</author>
    <author>Daniel Junglas</author>
    <author>Thorsten Koch</author>
    <author>Alexander Martin</author>
    <series>
      <title>ZIB-Report</title>
      <number>03-41</number>
    </series>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="institutes" number="">ZIB Allgemein</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="persons" number="koch">Koch, Thorsten</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/763/ZR-03-41.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/763/ZR-03-41.pdf</file>
  </doc>
  <doc>
    <id>562</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>1998-04-03</completedDate>
    <publishedDate>1998-04-03</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">The Orientation Model for Frequency Assignment Problems</title>
    <abstract language="eng">Mobile telecommunication systems establish a large number of communication links with a limited number of available frequencies; reuse of the same or adjacent frequencies on neighboring links causes interference. The task to find an assignment of frequencies to channels with minimal interference is the frequency assignment problem. The frequency assignment problem is usually treated as a graph coloring problem where the number of colors is minimized, but this approach does not model interference minimization correctly. We give in this paper a new integer programming formulation of the frequency assignment problem, the orientation model, and develop a heuristic two-stage method to solve it. The algorithm iteratively solves an outer and an inner optimization problem. The outer problem decides for each pair of communication links which link gets the higher frequency and leads to an acyclic subdigraph problem with additional longest path restrictions. The inner problem to find an optimal assignment respecting an orientation leads to a min-cost flow problem.</abstract>
    <identifier type="serial">TR-98-01</identifier>
    <identifier type="opus3-id">563</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-5627</identifier>
    <author>Ralf Borndörfer</author>
    <author>Andreas Eisenblätter</author>
    <author>Martin Grötschel</author>
    <author>Alexander Martin</author>
    <series>
      <title>ZIB-Report</title>
      <number>TR-98-01</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Minimum-Cost Flow Problems</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Cellular Radio Telephone Systems</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Frequency Assignment Problem</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Integer Programming</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="msc" number="90B10">Network models, deterministic</collection>
    <collection role="msc" number="90B80">Discrete location and assignment [See also 90C10]</collection>
    <collection role="msc" number="90C10">Integer programming</collection>
    <collection role="institutes" number="">ZIB Allgemein</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="persons" number="groetschel">Grötschel, Martin</collection>
    <collection role="projects" number="eplus-FAP">eplus-FAP</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/562/TR-98-01.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/562/TR-98-01.pdf</file>
  </doc>
  <doc>
    <id>782</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2004-02-10</completedDate>
    <publishedDate>2004-02-10</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">MOMENTUM Data Scenarios for Radio Network Planning and Simulation (Extended Abstract)</title>
    <abstract language="eng">We present publicly available data sets related to research on wireless networks. The scenarios contain a wide range of data and are detailed in all aspects. To our knowledge, this is the most realistic, comprehensive, and detailed \emph{public} data collection on mobile networking. We indicate example uses of this data collection in applications related tu UMTS.</abstract>
    <identifier type="serial">04-07</identifier>
    <identifier type="opus3-id">783</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-7829</identifier>
    <enrichment key="SourceTitle">A short version (extended abstract) is published in: Proc. of WiOpt '04. Cambridge, UK, 2004</enrichment>
    <author>Andreas Eisenblätter</author>
    <author>Hans-Florian Geerdes</author>
    <author>Thorsten Koch</author>
    <author>Ulrich Türke</author>
    <series>
      <title>ZIB-Report</title>
      <number>04-07</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Radio Network Planning</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Simulation</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>UMTS</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Realistic Data</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>XML</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="msc" number="94A99">None of the above, but in this section</collection>
    <collection role="institutes" number="">ZIB Allgemein</collection>
    <collection role="persons" number="koch">Koch, Thorsten</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/782/ZR-04-07.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/782/ZR-04-07.pdf</file>
  </doc>
  <doc>
    <id>790</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2004-05-07</completedDate>
    <publishedDate>2004-05-07</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">UMTS Radio Network Evaluation and Optimization beyond Snapshots</title>
    <abstract language="eng">This paper is concerned with UMTS radio network design. Our task is to reconfigure antennas and the related cells as to improve network quality. In contrast to second generation GSM networks, \emph{interference} plays a paramount role when designing third generation radio networks. A known compact formulation for assessing the interference characteristics of a radio network as coupling relations between cells based on user snapshots is generalized to statistical average load. This enables us to overcome the notorious difficulties of snapshot-based network optimization approaches. We recall a mixed-integer programming model for the network design problem that is based on user snapshots and contrast it with a new network design model based on the average coupling formulation. Exemplarily focusing on the important problem of optimizing antenna tilts, we give computational results for a fast local search algorithm and the application of a MIP solver to both models. These results demonstrate that our new average-based approaches outperform state-of-the-art snapshot models for UMTS radio network optimization.</abstract>
    <identifier type="serial">04-15</identifier>
    <identifier type="opus3-id">791</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-7903</identifier>
    <enrichment key="SourceTitle">Appeared in: Math. Meth. Oper. Res. 63(2006)1-29</enrichment>
    <author>Andreas Eisenblätter</author>
    <author>Hans-Florian Geerdes</author>
    <author>Thorsten Koch</author>
    <author>Alexander Martin</author>
    <author>Roland Wessäly</author>
    <series>
      <title>ZIB-Report</title>
      <number>04-15</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>UMTS</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Network planning</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Network design</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Optimization</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="msc" number="90C11">Mixed integer programming</collection>
    <collection role="institutes" number="">ZIB Allgemein</collection>
    <collection role="persons" number="koch">Koch, Thorsten</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/790/ZR-04-15.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/790/ZR-04-15.pdf</file>
  </doc>
  <doc>
    <id>615</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2000-12-12</completedDate>
    <publishedDate>2000-12-12</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Frequency Planning and Ramifications of Coloring</title>
    <abstract language="eng">This paper surveys frequency assignment problems coming up in planning wireless communication services. It particularly focuses on cellular mobile phone systems such as GSM, a technology that revolutionizes communication. Traditional vertex coloring provides a conceptual framework for the mathematical modeling of many frequency planning problems. This basic form, however, needs various extensions to cover technical and organizational side constraints. Among these ramifications are $T$-coloring and list coloring. To model all the subtleties, the techniques of integer programming have proven to be very useful. The ability to produce good frequency plans in practice is essential for the quality of mobile phone networks. The present algorithmic solution methods employ variants of some of the traditional coloring heuristics as well as more sophisticated machinery from mathematical programming. This paper will also address this issue. Finally, this paper discusses several practical frequency assignment problems in detail, states the associated mathematical models, and also points to public electronic libraries of frequency assignment problems from practice. The associated graphs have up to several thousand nodes and range from rather sparse to almost complete.</abstract>
    <identifier type="serial">00-47</identifier>
    <identifier type="opus3-id">616</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-6152</identifier>
    <enrichment key="SourceTitle">Appeared in: Discussiones Mathematicae, Graph Theory 22 (2002) 51-88</enrichment>
    <author>Andreas Eisenblätter</author>
    <author>Martin Grötschel</author>
    <author>Arie M.C.A. Koster</author>
    <series>
      <title>ZIB-Report</title>
      <number>00-47</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>frequency assignment</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>graph coloring</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="msc" number="05-02">Research exposition (monographs, survey articles)</collection>
    <collection role="msc" number="05C15">Coloring of graphs and hypergraphs</collection>
    <collection role="msc" number="05C90">Applications [See also 68R10, 81Q30, 81T15, 82B20, 82C20, 90C35, 92E10, 94C15]</collection>
    <collection role="msc" number="90-02">Research exposition (monographs, survey articles)</collection>
    <collection role="institutes" number="">ZIB Allgemein</collection>
    <collection role="persons" number="groetschel">Grötschel, Martin</collection>
    <collection role="projects" number="eplus-FAP">eplus-FAP</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/615/ZR-00-47.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/615/ZR-00-47.pdf</file>
  </doc>
  <doc>
    <id>676</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>deu</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2002-02-15</completedDate>
    <publishedDate>2002-02-15</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="deu">Frequenzplanung im Mobilfunk</title>
    <abstract language="deu">Telekommunikation ist seit Jahren \glqq in\grqq. Zunächst gab es einen enormen Aufschwung; neue Technologien und Dienste haben eine überwältigende, nicht vorhersehbare Akzeptanz gefunden. Derzeit ist -- ausgelöst durch die UMTS-Lizenzversteigerungen, Rezessions- und Sättigungstendenzen -- eine Krise zu verzeichnen. Viele (auch wir) sind davon überzeugt, dass technischer Fortschritt und nützliche Dienste demnächst die Stimmung wieder ändern werden. Wenigen ist allerdings bewusst, welche Rolle Mathematik bei der Entwicklung und dem effizienten Einsatz vieler der neuen Kommunikationstechnologien spielt. In diesem Artikel soll kein Überblick über diesen umfangreichen Themenkreis gegeben werden. Wir zeigen lediglich an einem konkreten Beispiel aus dem Mobilfunk, der Frequenzplanung in GSM-Funknetzen, was man durch geeignete Modellierung der praktischen Fragestellung und den Einsatz problemadäquater Algorithmen erreichen kann.</abstract>
    <identifier type="serial">02-09</identifier>
    <identifier type="opus3-id">677</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-6762</identifier>
    <enrichment key="SourceTitle">Erschienen in: DMV-Mitteilungen 1 (2002) S. 18-25</enrichment>
    <author>Andreas Eisenblätter</author>
    <author>Martin Grötschel</author>
    <author>Arie M.C.A. Koster</author>
    <series>
      <title>ZIB-Report</title>
      <number>02-09</number>
    </series>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Telekommunikation</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Frequenzplanung</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Mobilfunk</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>GSM-Funknetze</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="msc" number="05-02">Research exposition (monographs, survey articles)</collection>
    <collection role="msc" number="90-02">Research exposition (monographs, survey articles)</collection>
    <collection role="institutes" number="">ZIB Allgemein</collection>
    <collection role="persons" number="groetschel">Grötschel, Martin</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/676/ZR-02-09.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/676/ZR-02-09.pdf</file>
  </doc>
  <doc>
    <id>954</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-05-22</completedDate>
    <publishedDate>2007-05-22</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Reconciling Theory and Practice: A Revised Pole Equation for W-CDMA Cell Powers</title>
    <abstract language="eng">The performance evaluation of W-CDMA networks is intricate as cells are strongly coupled through interference. Pole equations have been developed as a simple tool to analyze cell capacity. Numerous scientific contributions have been made on their basis. In the established forms, the pole equations rely on strong assumptions such as homogeneous traffic, uniform users, and constant downlink orthogonality factor. These assumptions are not met in realistic scenarios. Hence, the pole equations are typically used during initial network dimensioning only. Actual network (fine-) planning requires a more faithful analysis of each individual cell's capacity. Complex analytical analysis or Monte-Carlo simulations are used for this purposes. In this paper, we generalize the pole equations to include inhomogeneous data. We show how the equations can be parametrized in a cell-specific way provided the transmit powers are known. This allows to carry over prior results to realistic settings. This is illustrated with an example: Based on the pole equation, we investigate the accuracy of average snapshot'' approximations for downlink transmit powers used in state-of-the-art network optimization schemes. We confirm that the analytical insights apply to practice-relevant settings on the basis of results from detailed Monte-Carlo simulation on realistic datasets.</abstract>
    <identifier type="serial">07-11</identifier>
    <identifier type="opus3-id">954</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-9543</identifier>
    <enrichment key="SourceTitle">Appeared in: Proc. MsWiM’07, 2007</enrichment>
    <author>Hans-Florian Geerdes</author>
    <author>Andreas Eisenblätter</author>
    <series>
      <title>ZIB-Report</title>
      <number>07-11</number>
    </series>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="institutes" number="">ZIB Allgemein</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/954/ZR-07-11.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/954/ZR-07-11.ps</file>
  </doc>
  <doc>
    <id>3251</id>
    <completedYear>2005</completedYear>
    <publishedYear>2005</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1</pageFirst>
    <pageLast>29</pageLast>
    <pageNumber/>
    <edition/>
    <issue>1</issue>
    <volume>63</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">UMTS Radio Network Evaluation and Optimization beyond Snapshots</title>
    <parentTitle language="eng">Mathematical Methods of Operations Research</parentTitle>
    <identifier type="doi">10.1007/s00186-005-0002-z</identifier>
    <identifier type="url">http://opus.kobv.de/zib/volltexte/2004/791/</identifier>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-7903</enrichment>
    <author>Andreas Eisenblätter</author>
    <author>Hans-Florian Geerdes</author>
    <author>Thorsten Koch</author>
    <author>Alexander Martin</author>
    <author>Roland Wessäly</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="koch">Koch, Thorsten</collection>
    <collection role="projects" number="MATHEON-B4:UMTS">MATHEON-B4:UMTS</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>3185</id>
    <completedYear>2008</completedYear>
    <publishedYear>2008</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>40</pageFirst>
    <pageLast>46</pageLast>
    <pageNumber/>
    <edition/>
    <issue>6</issue>
    <volume>35</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Planning UMTS Radio Networks</title>
    <parentTitle language="eng">OR/MS Today</parentTitle>
    <identifier type="url">http://www.lionhrtpub.com/orms/orms-12-08/frradio.html</identifier>
    <author>Andreas Eisenblätter</author>
    <author>Hans-Florian Geerdes</author>
    <author>Martin Grötschel</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="groetschel">Grötschel, Martin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>3118</id>
    <completedYear>1998</completedYear>
    <publishedYear>1998</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>73</pageFirst>
    <pageLast>93</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>76</volume>
    <type>article</type>
    <publisherName>J. C. Baltzer AG, Science Publishers</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Frequency assignment in cellular phone networks</title>
    <parentTitle language="eng">Annals of Operations Research</parentTitle>
    <identifier type="doi">10.1023/A:1018908907763</identifier>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-3044</enrichment>
    <author>Ralf Borndörfer</author>
    <author>Andreas Eisenblätter</author>
    <author>Martin Grötschel</author>
    <author>Alexander Martin</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="persons" number="groetschel">Grötschel, Martin</collection>
    <collection role="projects" number="eplus-FAP">eplus-FAP</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>3152</id>
    <completedYear>2002</completedYear>
    <publishedYear>2002</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>51</pageFirst>
    <pageLast>88</pageLast>
    <pageNumber/>
    <edition/>
    <issue>22</issue>
    <volume/>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Frequency Planning and Ramifications of Coloring</title>
    <parentTitle language="eng">Discussiones Mathematicae, Graph Theory</parentTitle>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-6152</enrichment>
    <author>Andreas Eisenblätter</author>
    <author>Martin Grötschel</author>
    <author>Arie M.C.A. Koster</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="groetschel">Grötschel, Martin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>3151</id>
    <completedYear>2002</completedYear>
    <publishedYear>2002</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>18</pageFirst>
    <pageLast>25</pageLast>
    <pageNumber/>
    <edition/>
    <issue>1</issue>
    <volume/>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Frequenzplanung im Mobilfunk</title>
    <parentTitle language="eng">DMV-Mitteilungen</parentTitle>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-6762</enrichment>
    <author>Andreas Eisenblätter</author>
    <author>Martin Grötschel</author>
    <author>Arie M.C.A. Koster</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="groetschel">Grötschel, Martin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2963</id>
    <completedYear>2002</completedYear>
    <publishedYear>2002</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1</pageFirst>
    <pageLast>24</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>bookpart</type>
    <publisherName>Kluwer</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Mathematical Model of Feasible Network Configurations for UMTS</title>
    <parentTitle language="eng">Telecommunications network design and management</parentTitle>
    <author>Andreas Eisenblätter</author>
    <editor>S. G. Anandalingam</editor>
    <author>Armin Fügenschuh</author>
    <author>Thorsten Koch</author>
    <author>Arie M.C.A. Koster</author>
    <author>Alexander Martin</author>
    <author>Tobias Pfender</author>
    <author>Oliver Wegel</author>
    <author>Roland Wessäly</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="achterberg">Achterberg, Tobias</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="persons" number="koch">Koch, Thorsten</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2969</id>
    <completedYear>2003</completedYear>
    <publishedYear>2003</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>other</type>
    <publisherName>IST-2000-28088 MOMENTUM Technical Report</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">XML Data Specification and Documentation</title>
    <author>Andreas Eisenblätter</author>
    <author>Armin Fügenschuh</author>
    <author>Hans-Florian Geerdes</author>
    <author>Thorsten Koch</author>
    <author>Ulrich Türke</author>
    <author>Ellen Meijerink</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="persons" number="koch">Koch, Thorsten</collection>
    <collection role="projects" number="MOMENTUM">MOMENTUM</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2958</id>
    <completedYear>2004</completedYear>
    <publishedYear>2004</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Integer Programming Methods for UMTS Radio Network Planning</title>
    <parentTitle language="eng">Proceedings of the WiOpt’04, Cambridge, UK</parentTitle>
    <author>Andreas Eisenblätter</author>
    <author>Armin Fügenschuh</author>
    <author>Hans-Florian Geerdes</author>
    <author>Daniel Junglas</author>
    <author>Thorsten Koch</author>
    <author>Alexander Martin</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="persons" number="koch">Koch, Thorsten</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>4834</id>
    <completedYear/>
    <publishedYear>2012</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>303</pageFirst>
    <pageLast>321</pageLast>
    <pageNumber/>
    <edition/>
    <issue>3</issue>
    <volume>9</volume>
    <type>article</type>
    <publisherName>Springer</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Multistage Stochastic Programming in Strategic Telecommunication Network Planning</title>
    <abstract language="eng">Mobile communication is nowadays taken for granted. Having started primarily as a service for speech communication, data service and mobile Internet access are now driving the evolution of network infrastructure. Operators are facing the challenge to match the demand by continuously expanding and upgrading the network infrastructure. However, the evolution of the customer's demand is uncertain. We introduce a novel (long-term) network planning approach based on multistage stochastic programming, where demand evolution is considered as a stochastic process and the network is extended as to maximize the expected profit. The approach proves capable of designing large-scale realistic UMTS networks with a time-horizon of several years. Our mathematical optimization model, the solution approach, and computational results are presented in this paper.</abstract>
    <parentTitle language="eng">Computational Management Science</parentTitle>
    <identifier type="doi">10.1007/s10287-012-0143-5</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-12232</enrichment>
    <author>Andreas Eisenblätter</author>
    <submitter>Jonas Schweiger</submitter>
    <author>Jonas Schweiger</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="institutes" number="tele">Mathematics of Telecommunication</collection>
    <collection role="persons" number="schweiger">Schweiger, Jonas</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>3323</id>
    <completedYear>2010</completedYear>
    <publishedYear>2010</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>232</pageFirst>
    <pageLast>241</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace>Avignon, France</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Two-Stage Approach to WLAN Planning</title>
    <parentTitle language="eng">Proc. of the 8th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt’10)</parentTitle>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Andreas Eisenblätter</author>
    <author>Hans-Florian Geerdes</author>
    <author>James Gross</author>
    <author>Oscar Puñal</author>
    <author>Jonas Schweiger</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="schweiger">Schweiger, Jonas</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>3278</id>
    <completedYear>2003</completedYear>
    <publishedYear>2003</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue>D4.3</issue>
    <volume/>
    <type>article</type>
    <publisherName>IST-2000-28088 MOMENTUM</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Mathematical Methods for Automatic Optimization of UMTS Radio Networks</title>
    <identifier type="url">http://momentum.zib.de/paper/momentum-d43.pdf</identifier>
    <author>Andreas Eisenblätter</author>
    <editor>Alexander Martin</editor>
    <author>Armin Fügenschuh</author>
    <author>E. Fledderus</author>
    <author>Hans-Florian Geerdes</author>
    <author>B. Heideck</author>
    <author>Daniel Junglas</author>
    <author>Thorsten Koch</author>
    <author>T. Kürner</author>
    <author>Alexander Martin</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="persons" number="koch">Koch, Thorsten</collection>
    <collection role="projects" number="MOMENTUM">MOMENTUM</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>3279</id>
    <completedYear>2003</completedYear>
    <publishedYear>2003</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue>D4.7</issue>
    <volume/>
    <type>article</type>
    <publisherName>IST-2000-28088 MOMENTUM</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Final Report on Automatic Planning and Optimisation</title>
    <identifier type="url">http://momentum.zib.de/paper/momentum-d47.pdf</identifier>
    <author>Andreas Eisenblätter</author>
    <author>Hans-Florian Geerdes</author>
    <author>Daniel Junglas</author>
    <author>Thorsten Koch</author>
    <author>T. Kürner</author>
    <author>Alexander Martin</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="koch">Koch, Thorsten</collection>
    <collection role="projects" number="MOMENTUM">MOMENTUM</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>1223</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-02-28</completedDate>
    <publishedDate>2011-02-28</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Multistage Stochastic Programming in Strategic Telecommunication Network Planning</title>
    <abstract language="eng">Mobile communication is nowadays taken for granted. Having started&#13;
primarily as a service for speech communication, data service and&#13;
mobile Internet access are now driving the evolution of network&#13;
infrastructure.  Operators are facing the challenge to match the&#13;
demand by continuously expanding and upgrading the network&#13;
infrastructure.  However, the evolution of the customer's demand is uncertain.&#13;
&#13;
We introduce a novel (long-term) network planning approach based on&#13;
multistage stochastic programming, where demand evolution is considered as&#13;
a stochastic process and the network is extended as to maximize the&#13;
expected profit. The approach proves capable of designing large-scale&#13;
realistic UMTS networks with a time-horizon of several years.  Our&#13;
mathematical optimization model, the solution approach, and computational&#13;
results are presented in this paper.</abstract>
    <identifier type="serial">11-06</identifier>
    <identifier type="doi">10.1007/s10287-012-0143-5</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-12232</identifier>
    <enrichment key="SourceTitle">Appeared in: Computational Management Science 9 Issue 3 (2012) pp. 303-321</enrichment>
    <author>Andreas Eisenblätter</author>
    <submitter>-empty- (Opus4 user: )</submitter>
    <author>Jonas Schweiger</author>
    <submitter>Jonas Schweiger</submitter>
    <series>
      <title>ZIB-Report</title>
      <number>11-06</number>
    </series>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>UMTS</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Network Evolution</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Multistage</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Stochastic Programming</value>
    </subject>
    <collection role="msc" number="90B18">Communication networks [See also 68M10, 94A05]</collection>
    <collection role="msc" number="90C15">Stochastic programming</collection>
    <collection role="msc" number="90C90">Applications of mathematical programming</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="schweiger">Schweiger, Jonas</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1223/ZR-11-06.pdf</file>
  </doc>
  <doc>
    <id>5355</id>
    <completedYear/>
    <publishedYear>2015</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>2015-02-02</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Optimal Battery Controlling for Smart Grid Nodes</title>
    <abstract language="eng">Energy storages can be of great value when added to power grids. They introduce the possibility to store and release energy whenever this is favorable. This is particularly relevant, for example, if power supply is volatile (as is the case with renewable energy) and the network is small (so that there are few other nodes that might balance fluctuations in consumption or production). We present models and methods from mathematical optimization for computing an optimized storage schedule for this purpose. We look at alternative optimization objectives, such as smallest possible peak load, low energy costs, or the close approximation of a prescribed load curve. The optimization needs to respect general operational and economic constraints as well as limitations in the use of storage, which are imposed by the chosen storage technology. We therefore introduce alternative approaches for modeling the non-linear properties of energy storages and study their impact on the efficiency of the optimization process. Finally, we present a computational study with batteries as storage devices. We use this to highlight the trade-off between solution quality and computational tractability. A version of the model for the purpose of leveling peaks and instabilities has been implemented into a control system for an office-building smart grid scenario.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-53550</identifier>
    <identifier type="doi">10.1007/978-4-431-55420-2_6</identifier>
    <enrichment key="SourceTitle">Appeared in: Optimization in the Real World - Towards Solving Real-World Optimization Problems, volume 13 of Mathematics for Industry, p. 97-113, Springer, 2015</enrichment>
    <author>Andreas Draegert</author>
    <submitter>Axel Werner</submitter>
    <author>Andreas Eisenblätter</author>
    <author>Inken Gamrath</author>
    <author>Axel Werner</author>
    <series>
      <title>ZIB-Report</title>
      <number>15-06</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>energy optimization, non-linear optimization, smart grid</value>
    </subject>
    <collection role="msc" number="90-XX">OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="projects" number="DESI">DESI</collection>
    <collection role="persons" number="inken.gamrath">Gamrath, Inken</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/5355/smart-grid-batteries.pdf</file>
  </doc>
  <doc>
    <id>2836</id>
    <completedYear>1996</completedYear>
    <publishedYear>1996</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>17</pageFirst>
    <pageLast>21</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>Universidade de São Paulo, Instituto de Matemática e Estatística</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Stable-Set and Other Techniques for Frequency Assignment Problems</title>
    <parentTitle language="eng">Anais da I Oficina Nacional em Problemas de Corte &amp; Empacotamento</parentTitle>
    <author>Ralf Borndörfer</author>
    <author>Andreas Eisenblätter</author>
    <author>Martin Grötschel</author>
    <author>Alexander Martin</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="persons" number="groetschel">Grötschel, Martin</collection>
    <collection role="projects" number="eplus-FAP">eplus-FAP</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>1013</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>doctoralthesis</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2001-12-31</completedDate>
    <publishedDate>2001-12-31</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Frequency Assignment in GSM Networks: Models, Heuristics, and Lower Bounds</title>
    <abstract language="eng">Mobile cellular communcication is a key technology in today's information age. Despite the continuing improvements in equipment design, interference is and will remain a limiting factor for the use of radio communication. This Ph. D. thesis investigates how to prevent interference to the largest possible extent when assigning the available frequencies to the base stations of a GSM cellular network. The topic is addressed from two directions: first, new algorithms are presented to compute "good" frequency assignments fast; second, a novel approach, based on semidef inite programming, is employed to provide lower bounds for the amount of unavoidable interference. The new methods proposed for automatic frequency planning are compared in terms of running times and effectiveness in computational experiments, where the planning instances are taken from practice. For most of the heuristics the running time behavior is adequate for inter active planning; at the same time, they provide reasonable assignments from a practical point of view (compared to the currently best known, but substantially slower planning methods). In fact, several of these methods are successfully applied by the German GSM network operator E-Plus. The currently best lower bounds on the amount of unavoidable (co-channel) interference are obtained from solving semidefinite programs These programs arise as nonpolyhedral relaxation of a minimum /c-parti tion problem on complete graphs. The success of this approach is made plausible by revealing structural relations between the feasible set of the semidefinite program and a polytope associated with an integer linear programming formulation of the minimum ^-partition problem. Comparable relations are not known to hold for any polynomial time solvable polyhedral relaxation of the minimum ^-partition problem. The appli cation described is one of the first of semidefinite programming for large industrial problems in combinatorial optimization.</abstract>
    <identifier type="opus3-id">1029</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-10132</identifier>
    <author>Andreas Eisenblätter</author>
    <submitter>unknown unknown</submitter>
    <collection role="ddc" number="080">Allgemeine Sammelwerke, Zitatensammlungen</collection>
    <collection role="collections" number="">Dissertationen</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="projects" number="eplus-FAP">eplus-FAP</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <thesisGrantor>Technische Universität Berlin</thesisGrantor>
    <file>https://opus4.kobv.de/opus4-zib/files/1013/eisenblaetter_diss.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/1013/eisenblaetter_diss.ps</file>
  </doc>
  <doc>
    <id>5166</id>
    <completedYear/>
    <publishedYear>2014</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>75</pageFirst>
    <pageLast>89</pageLast>
    <pageNumber/>
    <edition>EMS Series in Industrial and Applied Mathematics</edition>
    <issue/>
    <volume>1</volume>
    <type>incollection</type>
    <publisherName>European Mathematical Society</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Mathematics for telecommunications</title>
    <parentTitle language="eng">MATHEON - Mathematics for Key Technologies</parentTitle>
    <identifier type="doi">10.4171/137</identifier>
    <enrichment key="PeerReviewed">no</enrichment>
    <submitter>Axel Werner</submitter>
    <author>Axel Werner</author>
    <editor>Peter Deuflhard</editor>
    <editor>Martin Grötschel</editor>
    <author>Frank Aurzada</author>
    <editor>Dietmar Hömberg</editor>
    <author>Andreas Bley</author>
    <editor>Ulrich Horst</editor>
    <author>Andreas Eisenblätter</author>
    <author>Hans-Florian Geerdes</author>
    <editor>Jürg Kramer</editor>
    <editor>Volker Mehrmann</editor>
    <author>Mijail Guillemard</author>
    <author>Gitta Kutyniok</author>
    <editor>Konrad Polthier</editor>
    <author>Friedrich Philipp</author>
    <editor>Frank Schmidt</editor>
    <author>Christian Raack</author>
    <editor>Christof Schütte</editor>
    <author>Michael Scheutzow</author>
    <editor>Martin Skutella</editor>
    <editor>Jürgen Sprekels</editor>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="projects" number="DESI">DESI</collection>
    <collection role="projects" number="FTTX-PLAN">FTTX-PLAN</collection>
    <collection role="projects" number="MATHEON-B3">MATHEON-B3</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>5622</id>
    <completedYear/>
    <publishedYear>2015</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>97</pageFirst>
    <pageLast>113</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>13</volume>
    <type>conferenceobject</type>
    <publisherName>Springer</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Optimal battery control for smart grid nodes</title>
    <abstract language="eng">Energy storages can be of great value when added to power grids. They introduce the possibility to store and release energy whenever this is favorable. This is particularly relevant, for example, if power supply is volatile (as is the case with renewable energy) and the network is small (so that there are few other nodes that might balance fluctuations in consumption or production). We present models and methods from mathematical optimization for computing an optimized storage schedule for this purpose. We look at alternative optimization objectives, such as smallest possible peak load, low energy costs, or the close approximation of a prescribed load curve. The optimization needs to respect general operational and economic constraints as well as limitations in the use of storage, which are imposed by the chosen storage technology. We therefore introduce alternative approaches for modeling the non-linear properties of energy storages and study their impact on the efficiency of the optimization process. Finally, we present a computational study with batteries as storage devices. We use this to highlight the trade-off between solution quality and computational tractability. A version of the model for the purpose of leveling peaks and instabilities has been implemented into a control system for an office-building smart grid scenario.</abstract>
    <parentTitle language="eng">Optimization in the Real World - Towards Solving Real-World Optimization Problems</parentTitle>
    <identifier type="doi">10.1007/978-4-431-55420-2_6</identifier>
    <enrichment key="Series">Mathematics for Industry</enrichment>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-53550</enrichment>
    <author>Andreas Draegert</author>
    <editor>Katsuki Fujisawa</editor>
    <submitter>Axel Werner</submitter>
    <author>Andreas Eisenblätter</author>
    <editor>Yuji Shinano</editor>
    <author>Inken Gamrath</author>
    <editor>Hayato Waki</editor>
    <author>Axel Werner</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="projects" number="DESI">DESI</collection>
    <collection role="persons" number="inken.gamrath">Gamrath, Inken</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
</export-example>
