<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <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>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>
</export-example>
