<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>862</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2005-05-04</completedDate>
    <publishedDate>2005-05-04</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">MIPLIB 2003</title>
    <abstract language="eng">This paper reports on the fourth version of the Mixed Integer Programming Library. Since ({\sc miplib}) is to provide a concise set of challenging problems, it became necessary to purge instances that became too easy. We present an overview of the 27 new problems and statistical data for all 60 instances.</abstract>
    <identifier type="serial">05-28</identifier>
    <identifier type="opus3-id">862</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-8625</identifier>
    <enrichment key="SourceTitle">Appeared in: Operations Research Letters 34 (2006), Nr. 4, 1-12. DOI 10.1016/j.orl.2005.07.009</enrichment>
    <author>Tobias Achterberg</author>
    <author>Thorsten Koch</author>
    <author>Alexander Martin</author>
    <series>
      <title>ZIB-Report</title>
      <number>05-28</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Mathematical Programming</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Mixed Integer Programming</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>IP</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>MIP</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Optimization</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Instances</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="msc" number="90C06">Large-scale problems</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="koch">Koch, Thorsten</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/862/ZR-05-28.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/862/ZR-05-28.ps</file>
  </doc>
  <doc>
    <id>3253</id>
    <completedYear>2006</completedYear>
    <publishedYear>2006</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>361</pageFirst>
    <pageLast>372</pageLast>
    <pageNumber/>
    <edition/>
    <issue>4</issue>
    <volume>34</volume>
    <type>article</type>
    <publisherName>Elsevier / North-Holland</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">MIPLIB 2003</title>
    <parentTitle language="eng">Operations Research Letters</parentTitle>
    <identifier type="doi">10.1016/j.orl.2005.07.009</identifier>
    <identifier type="url">http://opus.kobv.de/zib/volltexte/2005/862/</identifier>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-8625</enrichment>
    <author>Tobias Achterberg</author>
    <author>Thorsten Koch</author>
    <author>Alexander Martin</author>
    <collection role="persons" number="achterberg">Achterberg, Tobias</collection>
    <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>3250</id>
    <completedYear>2005</completedYear>
    <publishedYear>2005</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>42</pageFirst>
    <pageLast>54</pageLast>
    <pageNumber/>
    <edition/>
    <issue>1</issue>
    <volume>33</volume>
    <type>article</type>
    <publisherName>Elsevier / North-Holland</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Branching Rules Revisited</title>
    <parentTitle language="eng">Operations Research Letters</parentTitle>
    <identifier type="doi">10.1016/j.orl.2004.04.002</identifier>
    <identifier type="url">http://opus.kobv.de/zib/volltexte/2004/789/</identifier>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-7886</enrichment>
    <author>Tobias Achterberg</author>
    <author>Thorsten Koch</author>
    <author>Alexander Martin</author>
    <collection role="persons" number="achterberg">Achterberg, Tobias</collection>
    <collection role="persons" number="koch">Koch, Thorsten</collection>
  </doc>
  <doc>
    <id>3239</id>
    <completedYear>1998</completedYear>
    <publishedYear>1998</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>207</pageFirst>
    <pageLast>232</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>32</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Solving Steiner tree problems in graphs to optimality</title>
    <parentTitle language="eng">Networks</parentTitle>
    <identifier type="doi">10.1002/(SICI)1097-0037(199810)32:3%3C207::AID-NET5%3E3.0.CO;2-O</identifier>
    <identifier type="url">http://opus.kobv.de/zib/volltexte/1996/253/</identifier>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-2526</enrichment>
    <author>Thorsten Koch</author>
    <author>Alexander Martin</author>
    <collection role="persons" number="koch">Koch, Thorsten</collection>
  </doc>
  <doc>
    <id>3242</id>
    <completedYear>2001</completedYear>
    <publishedYear>2001</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>285</pageFirst>
    <pageLast>325</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">SteinLib: An Updated Library on Steiner Tree Problems in Graphs</title>
    <parentTitle language="eng">Steiner Trees in Industry</parentTitle>
    <identifier type="doi">10.1007/978-1-4613-0255-1_9</identifier>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-6056</enrichment>
    <author>Thorsten Koch</author>
    <editor>D.-Z. Du</editor>
    <author>Alexander Martin</author>
    <editor>X. Cheng</editor>
    <author>Stefan Voß</author>
    <collection role="persons" number="koch">Koch, Thorsten</collection>
  </doc>
  <doc>
    <id>252</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>1996-11-27</completedDate>
    <publishedDate>1996-11-27</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Solving Steiner Tree Problems in Graphs to Optimality</title>
    <abstract language="eng">In this paper we present the implementation of a branch-and-cut algorithm for solving Steiner tree problems in graphs. Our algorithm is based on an integer programming formulation for directed graphs and comprises preprocessing, separation algorithms and primal heuristics. We are able to solve all problem instances discussed in literature to optimality, including one to our knowledge not yet solved problem. We also report on our computational experiences with some very large Steiner tree problems arising from the design of electronic circuits. All test problems are gathered in a newly introduced library called {\em SteinLib} that is accessible via World Wide Web.</abstract>
    <identifier type="serial">SC-96-42</identifier>
    <identifier type="opus3-id">253</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-2526</identifier>
    <enrichment key="SourceTitle">Appeared in: Networks 32, 1998, 207-232</enrichment>
    <author>Thorsten Koch</author>
    <author>Alexander Martin</author>
    <series>
      <title>ZIB-Report</title>
      <number>SC-96-42</number>
    </series>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="institutes" number="">ZIB Allgemein</collection>
    <collection role="persons" number="koch">Koch, Thorsten</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/252/SC-96-42.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/252/SC-96-42.pdf</file>
  </doc>
  <doc>
    <id>7806</id>
    <completedYear/>
    <publishedYear>2019</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>866</pageFirst>
    <pageLast>888</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>37</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Tackling Industrial-Scale Supply Chain Problems by Mixed-Integer Programming</title>
    <abstract language="eng">The modeling flexibility and the optimality guarantees provided by mixed-integer programming greatly aid the design of robust and future-proof decision support systems. The complexity of industrial-scale supply chain optimization, however, often poses limits to the application of general mixed-integer programming solvers. In this paper we describe algorithmic innovations that help to ensure that MIP solver performance matches the complexity of the large supply chain problems and tight time limits encountered in practice. Our computational evaluation is based on a diverse set, modeling real-world scenarios supplied by our industry partner SAP.</abstract>
    <parentTitle language="eng">Journal of Computational Mathematics</parentTitle>
    <identifier type="doi">10.4208/jcm.1905-m2019-0055</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-61107</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <author>Gerald Gamrath</author>
    <submitter>Ambros Gleixner</submitter>
    <author>Ambros Gleixner</author>
    <author>Thorsten Koch</author>
    <author>Matthias Miltenberger</author>
    <author>Dimitri Kniasew</author>
    <author>Dominik Schlögel</author>
    <author>Alexander Martin</author>
    <author>Dieter Weninger</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="institutes" number="mip">Mathematical Optimization Methods</collection>
    <collection role="persons" number="gamrath">Gamrath, Gerald</collection>
    <collection role="persons" number="koch">Koch, Thorsten</collection>
    <collection role="persons" number="miltenberger">Miltenberger, Matthias</collection>
    <collection role="projects" number="ASTfSCM">ASTfSCM</collection>
    <collection role="projects" number="MIP-ZIBOPT">MIP-ZIBOPT</collection>
    <collection role="projects" number="MODAL-SynLab">MODAL-SynLab</collection>
    <collection role="projects" number="MODAL-Gesamt">MODAL-Gesamt</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>8073</id>
    <completedYear/>
    <publishedYear>2020</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>23</pageFirst>
    <pageLast>28</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>35</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Capacity Evaluation for Large-Scale Gas Networks</title>
    <parentTitle language="eng">German Success Stories in Industrial Mathematics</parentTitle>
    <identifier type="doi">10.1007/978-3-030-81455-7</identifier>
    <identifier type="isbn">978-3-030-81454-0</identifier>
    <enrichment key="PeerReviewed">no</enrichment>
    <enrichment key="AcceptedDate">2020</enrichment>
    <author>Thorsten Koch</author>
    <author>Martin Schmidt</author>
    <author>Benjamin Hiller</author>
    <author>Marc Pfetsch</author>
    <author>Björn Geißler</author>
    <author>René Henrion</author>
    <author>Imke Joormann</author>
    <author>Alexander Martin</author>
    <author>Antonio Morsi</author>
    <author>Werner Römisch</author>
    <author>Lars Schewe</author>
    <author>Rüdiger Schultz</author>
    <collection role="persons" number="koch">Koch, Thorsten</collection>
    <collection role="projects" number="MODAL-Gesamt">MODAL-Gesamt</collection>
    <collection role="institutes" number="Mathematical Algorithmic Intelligence">Mathematical Algorithmic Intelligence</collection>
    <collection role="institutes" number="aim">Applied Algorithmic Intelligence Methods</collection>
    <collection role="projects" number="MODAL-EnergyLab">MODAL-EnergyLab</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>4253</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2013-09-23</completedDate>
    <publishedDate>2013-09-23</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Progress in Presolving for Mixed Integer Programming</title>
    <abstract language="eng">Presolving attempts to eliminate redundant information from the problem formulation and simultaneously tries to strengthen the formulation. It can be very effective and is often essential for solving instances. Especially for mixed integer programming problems, fast and effective presolving algorithms are very important. In this paper, we report on three new presolving techniques. The first method searches for singleton continuous columns and tries to fix the corresponding variables. Then we present a presolving technique which exploits a partial order of the variables to induce fixings. Finally, we show an approach based on connected components in graphs. Our computational results confirm the profitable use of the algorithms in practice.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-42530</identifier>
    <identifier type="doi">10.1007/s12532-015-0083-5</identifier>
    <enrichment key="SourceTitle">Appeared in: Mathematical Programming Computation, vol. 7 iss. 4 (2015),  pp. 367-398</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-42530</enrichment>
    <submitter>Gerald Gamrath</submitter>
    <author>Gerald Gamrath</author>
    <author>Thorsten Koch</author>
    <author>Alexander Martin</author>
    <author>Matthias Miltenberger</author>
    <author>Dieter Weninger</author>
    <series>
      <title>ZIB-Report</title>
      <number>13-48</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>mixed-integer programming</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>presolving</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>preprocessing</value>
    </subject>
    <collection role="ccs" number="G.4">MATHEMATICAL SOFTWARE</collection>
    <collection role="msc" number="90-04">Explicit machine computation and programs (not the theory of computation or programming)</collection>
    <collection role="msc" number="90-08">Computational methods</collection>
    <collection role="msc" number="90C11">Mixed integer programming</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="institutes" number="mip">Mathematical Optimization Methods</collection>
    <collection role="persons" number="gamrath">Gamrath, Gerald</collection>
    <collection role="persons" number="koch">Koch, Thorsten</collection>
    <collection role="persons" number="miltenberger">Miltenberger, Matthias</collection>
    <collection role="projects" number="ASTfSCM">ASTfSCM</collection>
    <collection role="projects" number="MIP-ZIBOPT">MIP-ZIBOPT</collection>
    <collection role="projects" number="MODAL-GasLab">MODAL-GasLab</collection>
    <collection role="projects" number="MODAL-SynLab">MODAL-SynLab</collection>
    <collection role="projects" number="Siemens">Siemens</collection>
    <collection role="projects" number="MODAL-Gesamt">MODAL-Gesamt</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/4253/ZR-13-48.pdf</file>
  </doc>
  <doc>
    <id>605</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-11-27</completedDate>
    <publishedDate>2000-11-27</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">SteinLib: An Updated Library on Steiner Tree Problems in Graphs</title>
    <abstract language="eng">In this paper we present the {\em SteinLib}, a library of data sets for the Steiner tree problem in graphs. This library extends former libraries on Steiner tree problems by many new interesting and difficult instances, most of them arising from real-world applications. We give a survey on the difficulty of these problem instances by giving references to state-of-the-art software packages that were the first or are currently among the best to solve these instances.</abstract>
    <identifier type="serial">00-37</identifier>
    <identifier type="opus3-id">606</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-6056</identifier>
    <enrichment key="SourceTitle">Appeared in: Steiner Trees in Industry. D.-Z. Du, X. Cheng (eds.) Kluwer 2001, pp. 285-325</enrichment>
    <author>Thorsten Koch</author>
    <author>Alexander Martin</author>
    <author>Stefan Voß</author>
    <series>
      <title>ZIB-Report</title>
      <number>00-37</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Steiner Trees</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Mathematical Programming Testdata Library</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="msc" number="90C10">Integer programming</collection>
    <collection role="msc" number="90C27">Combinatorial optimization</collection>
    <collection role="msc" number="90C35">Programming involving graphs or networks [See also 90C27]</collection>
    <collection role="institutes" number="">ZIB Allgemein</collection>
    <collection role="persons" number="koch">Koch, Thorsten</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/605/ZR-00-37.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/605/ZR-00-37.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>699</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-10-04</completedDate>
    <publishedDate>2002-10-04</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Branching on History Information</title>
    <abstract language="eng">Mixed integer programs ($MIPs$) are commonly solved with branch and bound algorithms based on linear programming. The success and the speed of the algorithm strongly depends on the strategy used to select the branching variables. Today's state-of-the-art strategy is called \emph{pseudocost branching} and uses information of previous branchings to determine the current branching. We propose a modification of \emph{pseudocost branching} which we call \emph{history branching}. This strategy has been implemented in $SIP$, a state-of-the-art $MIP$ solver. We give computational results that show the superiority of the new strategy.</abstract>
    <identifier type="serial">02-32</identifier>
    <identifier type="opus3-id">700</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-6990</identifier>
    <author>Tobias Achterberg</author>
    <author>Thorsten Koch</author>
    <author>Alexander Martin</author>
    <series>
      <title>ZIB-Report</title>
      <number>02-32</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Mixed Integer Programming</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Branch-and-Bound</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Branching Rules</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Pseudocost Branching</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="msc" number="68W01">General</collection>
    <collection role="msc" number="90-08">Computational methods</collection>
    <collection role="institutes" number="">ZIB Allgemein</collection>
    <collection role="persons" number="achterberg">Achterberg, Tobias</collection>
    <collection role="persons" number="koch">Koch, Thorsten</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/699/ZR-02-32.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/699/ZR-02-32.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>788</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-03</completedDate>
    <publishedDate>2004-05-03</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Branching rules revisited</title>
    <abstract language="eng">Mixed integer programs are commonly solved with linear programming based branch-and-bound algorithms. The success of the algorithm strongly depends on the strategy used to select the variable to branch on. We present a new generalization called {\sl reliability branching} of today's state-of-the-art {\sl strong branching} and {\sl pseudocost branching} strategies for linear programming based branch-and-bound algorithms. After reviewing commonly used branching strategies and performing extensive computational studies we compare different parameter settings and show the superiority of our proposed newstrategy.</abstract>
    <identifier type="serial">04-13</identifier>
    <identifier type="opus3-id">789</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-7886</identifier>
    <enrichment key="SourceTitle">Appeared in : Operation Research Letters 33 (2005),pp. 42-54. DOI 10.1016/j.orl.2004.04.002</enrichment>
    <author>Tobias Achterberg</author>
    <author>Thorsten Koch</author>
    <author>Alexander Martin</author>
    <series>
      <title>ZIB-Report</title>
      <number>04-13</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Mixed-integer-programming</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Branch-and-Bound</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Variable selection</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Pseudocost-Branching</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Strong-Branching</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Reliability-Branching</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="msc" number="90-08">Computational methods</collection>
    <collection role="institutes" number="">ZIB Allgemein</collection>
    <collection role="persons" number="achterberg">Achterberg, Tobias</collection>
    <collection role="persons" number="koch">Koch, Thorsten</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/788/ZR-04-13.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/788/ZR-04-13.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>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>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>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>
</export-example>
