<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <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>2974</id>
    <completedYear>2006</completedYear>
    <publishedYear>2006</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>71</pageFirst>
    <pageLast>72</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>28</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">EURO Summer Institute 2006 in Wittenberg</title>
    <parentTitle language="eng">OR News</parentTitle>
    <author>Mirjam Dür</author>
    <author>Armin Fügenschuh</author>
    <author>Petra Huhn</author>
    <author>Kathrin Klamroth</author>
    <author>Sleman Saliba</author>
    <author>Christiane Tammer</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </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>1234</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-03-15</completedDate>
    <publishedDate>2011-03-15</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Gas Network Topology Optimization for Upcoming Market Requirements</title>
    <abstract language="eng">Gas distribution networks are complex structures that consist of&#13;
passive pipes, and active, controllable elements such as valves and&#13;
compressors. Controlling such network means to find a suitable setting&#13;
for all active components such that a nominated amount of gas can be&#13;
transmitted from entries to exits through the network, without&#13;
violating physical or operational constraints. The control of a&#13;
large-scale gas network is a challenging task from a practical point&#13;
of view. In most companies the actual controlling process is supported&#13;
by means of computer software that is able to simulate the flow of the&#13;
gas. However, the active settings have to be set manually within such&#13;
simulation software. The solution quality thus depends on the&#13;
experience of a human planner.&#13;
&#13;
When the gas network is insufficient for the transport then topology&#13;
extensions come into play. Here a set of new pipes or active elements&#13;
is determined such that the extended network admits a feasible control&#13;
again. The question again is how to select these extensions and where&#13;
to place them such that the total extension costs are&#13;
minimal. Industrial practice is again to use the same simulation&#13;
software, determine extensions by experience, add them to the virtual&#13;
network, and then try to find a feasible control of the active&#13;
elements. The validity of this approach now depends even more on the&#13;
human planner.&#13;
&#13;
Another weakness of this manual simulation-based approach is that it&#13;
cannot establish infeasibility of a certain gas nomination, unless all&#13;
settings of the active elements are tried. Moreover, it is impossible&#13;
to find a cost-optimal network extension in this way.&#13;
In order to overcome these shortcomings of the manual planning&#13;
approach we present a new approach, rigorously based on mathematical&#13;
optimization. Hereto we describe a model for finding feasible&#13;
controls and then extend this model such that topology extensions can&#13;
additionally and simultaneously be covered. Numerical results for real-world instances are presented and&#13;
discussed.</abstract>
    <identifier type="serial">11-09</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-12348</identifier>
    <identifier type="doi">10.1109/EEM.2011.5953035</identifier>
    <enrichment key="SourceTitle">Appeared in: Engery Market (EEM), 2011 8th International Conference on the European, Zagreb, 25-27 May 2011, pp. 346-351</enrichment>
    <author>Armin Fügenschuh</author>
    <submitter>-empty- (Opus4 user: )</submitter>
    <author>Benjamin Hiller</author>
    <submitter>Jonas Schweiger</submitter>
    <author>Jesco Humpola</author>
    <author>Thorsten Koch</author>
    <author>Thomas Lehmann</author>
    <author>Robert Schwarz</author>
    <author>Jonas Schweiger</author>
    <author>Jácint Szabó</author>
    <series>
      <title>ZIB-Report</title>
      <number>11-09</number>
    </series>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Mathematical Optimization</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Gas Distribution Networks</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Topology Planning</value>
    </subject>
    <collection role="msc" number="76N25">Flow control and optimization</collection>
    <collection role="msc" number="90B10">Network models, deterministic</collection>
    <collection role="msc" number="90C11">Mixed integer programming</collection>
    <collection role="msc" number="90C30">Nonlinear programming</collection>
    <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="MODAL-GasLab">MODAL-GasLab</collection>
    <collection role="projects" number="ForNe">ForNe</collection>
    <collection role="projects" number="MODAL-Gesamt">MODAL-Gesamt</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/1234/ZR-11-09.pdf</file>
  </doc>
  <doc>
    <id>2950</id>
    <completedYear>2006</completedYear>
    <publishedYear>2006</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>327</pageFirst>
    <pageLast>336</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Topology- and shape-optimization of branched sheet metal products</title>
    <parentTitle language="eng">Operations Research Proceedings</parentTitle>
    <author>Herbert Birkhofer</author>
    <editor>Hans-Dietrich Haasis</editor>
    <author>Armin Fügenschuh</author>
    <editor>Herbert Kopfer</editor>
    <editor>Jörn Schönberger</editor>
    <author>Ute Günther</author>
    <author>Daniel Junglas</author>
    <author>Alexander Martin</author>
    <author>Thorsten Sauer</author>
    <author>Stefan Ulbrich</author>
    <author>Martin Wäldele</author>
    <author>Stephan Walter</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2948</id>
    <completedYear>2007</completedYear>
    <publishedYear>2007</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>37</pageFirst>
    <pageLast>47</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Diskrete und kontinuierliche Modelle zur Topologie- und Geometrie-Optimierung von Blechprofilen</title>
    <parentTitle language="eng">Sonderforschungsbereich 666</parentTitle>
    <author>Armin Fügenschuh</author>
    <editor>P. Groche</editor>
    <author>Wolfgang Hess</author>
    <author>Alexander Martin</author>
    <author>Stefan Ulbrich</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2947</id>
    <completedYear>2007</completedYear>
    <publishedYear>2007</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>501</pageFirst>
    <pageLast>518</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Water Contamination Detection</title>
    <parentTitle language="eng">eOrganisation</parentTitle>
    <author>Armin Fügenschuh</author>
    <editor>A. Oberweis</editor>
    <author>Simone Göttlich</author>
    <editor>C. Weinhardt</editor>
    <author>Michael Herty</author>
    <editor>H. Gimpel</editor>
    <editor>A. Koschmider</editor>
    <editor>V. Pankratius</editor>
    <editor>B. Schnizler</editor>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2951</id>
    <completedYear>2006</completedYear>
    <publishedYear>2006</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>61</pageFirst>
    <pageLast>72</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Parametrized GRASP Heuristics for Three-Index Assignment</title>
    <parentTitle language="eng">Evolutionary Computation in Combinatorial Optimization</parentTitle>
    <author>Armin Fügenschuh</author>
    <editor>J. Gottlieb</editor>
    <author>Benjamin Höfler</author>
    <editor>G. Raidl</editor>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2949</id>
    <completedYear>2007</completedYear>
    <publishedYear>2007</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>17</pageFirst>
    <pageLast>22</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Scheduling Buses and School Starting Times</title>
    <parentTitle language="eng">Operations Research Proceedings</parentTitle>
    <author>Armin Fügenschuh</author>
    <editor>Karl-Heinz Waldmann</editor>
    <editor>Ulrike Stocker</editor>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>1899</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-07-19</completedDate>
    <publishedDate>2013-07-19</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">The Freight Train Routing Problem</title>
    <abstract language="eng">We consider the following freight train routing problem (FTRP). Given is a&#13;
transportation network with fixed routes for passenger trains and a&#13;
set of freight trains (requests), each defined by an origin and&#13;
destination station pair. The objective is to calculate a feasible&#13;
route for each freight train such that a sum of all expected delays and&#13;
all running times is minimal. Previous research concentrated on&#13;
microscopic train routings for junctions or inside major stations. Only&#13;
recently approaches were developed to tackle larger corridors or even&#13;
networks. We investigate the routing problem from a strategic&#13;
perspective, calculating the routes in a macroscopic transportation&#13;
network of Deutsche Bahn AG. Here macroscopic refers to an aggregation of &#13;
complex real-world structures are into fewer network elements. Moreover, the &#13;
departure and arrival times of freight trains are approximated. &#13;
The problem has a strategic&#13;
character since it asks only for a coarse routing through the network&#13;
without the precise timings. We give a mixed-integer nonlinear programming~(MINLP) &#13;
formulation for FTRP, which is a multi-commodity flow model on a time-expanded &#13;
graph with additional routing constraints. The model's nonlinearities are due to &#13;
an algebraic approximation of the delays of the trains on the arcs of&#13;
the network &#13;
by capacity restraint functions. The MINLP is reduced to a mixed-integer linear model~(MILP) &#13;
by piecewise linear approximation. The latter is solved by a state of the art MILP solver for various real-world test instances.</abstract>
    <identifier type="urn">urn:nbn:de:0297-zib-18991</identifier>
    <author>Ralf Borndörfer</author>
    <submitter>Torsten Klug</submitter>
    <author>Armin Fügenschuh</author>
    <author>Torsten Klug</author>
    <author>Thilo Schang</author>
    <author>Thomas Schlechte</author>
    <author>Hanno Schülldorf</author>
    <series>
      <title>ZIB-Report</title>
      <number>13-36</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Mixed-Integer Nonlinear Programming</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>multi-commodity flows</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>freight train routing</value>
    </subject>
    <collection role="msc" number="90-XX">OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="persons" number="klug">Klug, Torsten</collection>
    <collection role="persons" number="schlechte">Schlechte, Thomas</collection>
    <collection role="projects" number="KOSMOS">KOSMOS</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1899/ZR-13-36.pdf</file>
  </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>2962</id>
    <completedYear>2003</completedYear>
    <publishedYear>2003</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>21</pageFirst>
    <pageLast>43</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>bookpart</type>
    <publisherName>UVW UniversitätsVerlagWebler, Bielefeld</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Von Mikrochips, Proteinen und Schulbussen – Projektproseminare im Mathematikstudium</title>
    <parentTitle language="eng">Projektveranstaltungen in Mathematik, Informatik und Ingenieurwissenschaften</parentTitle>
    <author>Armin Fügenschuh</author>
    <editor>W. Görts</editor>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2978</id>
    <completedYear>2002</completedYear>
    <publishedYear>2002</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>other</type>
    <publisherName>Mathematische Modellierung mit Schülern - Die Modellierungswoche im Kloster Höchst. M. Kiehl, A. Schich, S. Purpus (Hrsg.). Zentrum für Mathematik, Bensheim</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Einsatzplanung von ÖPNV-Bussen</title>
    <author>Armin Fügenschuh</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2979</id>
    <completedYear>2001</completedYear>
    <publishedYear>2001</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>other</type>
    <publisherName>Mathematische Modellierung mit Schülern - Die Modellierungswoche im Kloster Höchst. M. Kiehl, A. Schich, S. Purpus (Hrsg.). Zentrum für Mathematik, Bensheim</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Proteinfaltung</title>
    <author>Armin Fügenschuh</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2975</id>
    <completedYear>2006</completedYear>
    <publishedYear>2006</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>other</type>
    <publisherName>Bild der Wissenschaft 11/2006, Sonderbeilage zum Klaus-Tschira-Preis</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Optimale Schulanfangszeiten</title>
    <author>Armin Fügenschuh</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2959</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">Integrated Optimization of School Starting Times and Public Bus Services</title>
    <parentTitle language="eng">Mathematics in the Supply Chain</parentTitle>
    <enrichment key="Series">Oberwolfach Report, Vol. 1, No. 2, Report 19</enrichment>
    <author>Armin Fügenschuh</author>
    <editor>Robert E. Bixby</editor>
    <author>Alexander Martin</author>
    <editor>D. Simchi-Levi</editor>
    <author>Peter Stöveken</author>
    <editor>Alexander Martin</editor>
    <editor>U. Zimmermann</editor>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</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>2956</id>
    <completedYear>2005</completedYear>
    <publishedYear>2005</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>21</pageFirst>
    <pageLast>31</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Parametrized Greedy Heuristics in Theory and Practice</title>
    <parentTitle language="eng">Hybrid Metaheuristics, Second International Workshop, HM 2005, Barcelona</parentTitle>
    <enrichment key="Series">Lecture Notes in Computer Science, Vol. 3636</enrichment>
    <author>Armin Fügenschuh</author>
    <editor>María J. Aguilera</editor>
    <editor>Christian Blum</editor>
    <editor>Andrea Roli</editor>
    <editor>Michael Sampels</editor>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2961</id>
    <completedYear>2005</completedYear>
    <publishedYear>2005</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>69</pageFirst>
    <pageLast>122</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>bookpart</type>
    <publisherName>North-Holland</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Computational Integer Programming and Cutting Planes</title>
    <parentTitle language="eng">Handbooks in Operations Research and Management Science, Vol. 12</parentTitle>
    <author>Armin Fügenschuh</author>
    <editor>Karen I. Aardal</editor>
    <author>Alexander Martin</author>
    <editor>George Nemhauser</editor>
    <editor>R. Weismantel</editor>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2957</id>
    <completedYear>2005</completedYear>
    <publishedYear>2005</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>706</pageFirst>
    <pageLast>711</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Scheduling Buses in Rural Areas</title>
    <parentTitle language="eng">Advanced OR and AI Methods in Transportation, 10th EWGT / 16th Mini-Euro Conference Proceedings, Poznan</parentTitle>
    <author>Armin Fügenschuh</author>
    <editor>A. Jaszkiewicz</editor>
    <editor>M. Kaczmarek</editor>
    <editor>J. Zak</editor>
    <editor>M. Kubiak</editor>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>1815</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-04-23</completedDate>
    <publishedDate>2013-04-23</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A System Dynamic Enhancement for the Scenario Technique</title>
    <abstract language="eng">The Scenario Technique is a strategic planning method that aims to describe and analyze potential developments of a considered system in the future. Its application consists of several steps, from an initial problem analysis over an influence analysis to projections of key factors and a definition of the scenarios to a final interpretation of the results. The technique itself combines qualitative and quantitative methods and is an enhancement of the standard Scenario Technique. We use the numerical values gathered during the influence analysis, and embed them in a System Dynamics framework. This yields a mathematically rigorous way to achieve predictions of the system‘s future behavior from an initial impulse and the feedback structure of the factors. The outcome of our new method is a further way of projecting the present into the future, which enables the user of the Scenario Technique to obtain a validation of the results achieved by the standard method.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-18150</identifier>
    <identifier type="url">http://opus4.kobv.de/opus4-tuberlin/frontdoor/index/index/docId/4026</identifier>
    <enrichment key="SourceTitle">Appeared in: Proceedings of the 11th Global Conference on Sustainable Manufacturing (GCSM2013), G. Seliger (Hrsg.), Universitätsverlag der TU Berlin, Seite 613 -- 618</enrichment>
    <author>Achim Brose</author>
    <submitter>Armin Fügenschuh</submitter>
    <author>Armin Fügenschuh</author>
    <author>Pia Gausemeier</author>
    <author>Ingmar Vierhaus</author>
    <author>Günther Seliger</author>
    <series>
      <title>ZIB-Report</title>
      <number>13-24</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Scenario Technique; System Dynamics</value>
    </subject>
    <collection role="msc" number="90-XX">OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="projects" number="CRC1026">CRC1026</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1815/ZR-13-24.pdf</file>
  </doc>
  <doc>
    <id>2952</id>
    <completedYear>2006</completedYear>
    <publishedYear>2006</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">Locomotive and Wagon Scheduling in Freight Transport</title>
    <parentTitle language="eng">Proceedings of the ATMOS06</parentTitle>
    <author>Armin Fügenschuh</author>
    <editor>R. Jacob</editor>
    <author>Henning Homfeld</author>
    <editor>Matthias Müller-Hannemann</editor>
    <author>Andreas Huck</author>
    <author>Alexander Martin</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2954</id>
    <completedYear>2005</completedYear>
    <publishedYear>2005</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>419</pageFirst>
    <pageLast>436</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Ein Planungstool zur Schulzeitstaffelung</title>
    <parentTitle language="eng">Supply Chain Management und Logistik</parentTitle>
    <author>Armin Fügenschuh</author>
    <editor>H.-O. Günther</editor>
    <author>Alexander Martin</author>
    <editor>D. Mattfeld</editor>
    <author>Christian Mehlert</author>
    <editor>L. Suhl</editor>
    <author>Peter Stöveken</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2953</id>
    <completedYear>2005</completedYear>
    <publishedYear>2005</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>150</pageFirst>
    <pageLast>157</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Integrated Optimization of School Starting Times and Public Bus Services</title>
    <parentTitle language="eng">Operations Research Proceedings</parentTitle>
    <author>Armin Fügenschuh</author>
    <editor>Hein Fleuren</editor>
    <author>Alexander Martin</author>
    <editor>Dick den Hertog</editor>
    <author>Peter Stöveken</author>
    <editor>Peter Kort</editor>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2955</id>
    <completedYear>2005</completedYear>
    <publishedYear>2005</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>265</pageFirst>
    <pageLast>278</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Integrierte Optimierung der Schulanfangszeit und des Nahverkehrs-Angebots</title>
    <parentTitle language="eng">Tagungsband der Heureka’05 – Optimierung in Verkehr und Transport</parentTitle>
    <author>Armin Fügenschuh</author>
    <author>Peter Stöveken</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2943</id>
    <completedYear>2007</completedYear>
    <publishedYear>2007</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>2060049</pageFirst>
    <pageLast>2060050</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Mixed-integer models for topology optimization in sheet metal design</title>
    <parentTitle language="eng">Sixth International Congress on Industrial Applied Mathematics (ICIAM07) and GAMM Annual Meeting, Zürich 2007</parentTitle>
    <enrichment key="Series">PAMM Proc. Appl. Math. Mech., Vol. 7, No. 1</enrichment>
    <author>Armin Fügenschuh</author>
    <author>Alexander Martin</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2946</id>
    <completedYear>2007</completedYear>
    <publishedYear>2007</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>45</pageFirst>
    <pageLast>60</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A new modeling approach for an integrated simulation and optimization of production networks</title>
    <parentTitle language="eng">Management logistischer Netzwerke</parentTitle>
    <author>Armin Fügenschuh</author>
    <editor>H.-O. Günther</editor>
    <author>Simone Göttlich</author>
    <editor>D. Mattfeld</editor>
    <author>Michael Herty</author>
    <editor>L. Suhl</editor>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2945</id>
    <completedYear>2007</completedYear>
    <publishedYear>2007</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">Algorithmenbasierte Produktentwicklung für integrale Blechbauweisen höherer Verzweigungsordnung</title>
    <parentTitle language="eng">Optimierung in der Produktentwicklung, 5. Geimeinsames Kolloquium Konstruktionstechnik</parentTitle>
    <author>Herbert Birkhofer</author>
    <author>Armin Fügenschuh</author>
    <author>Alexander Martin</author>
    <author>Martin Wäldele</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2944</id>
    <completedYear>2007</completedYear>
    <publishedYear>2007</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">Ausschreibung von Linienbündeln versus Schulzeitkoordinierung?</title>
    <parentTitle language="eng">VWT Conference e-Proceedings</parentTitle>
    <author>Armin Fügenschuh</author>
    <author>Matthias Prick</author>
    <author>Peter Stöveken</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2942</id>
    <completedYear>2008</completedYear>
    <publishedYear>2008</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>21</pageFirst>
    <pageLast>31</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Iterated Greedy Algorithms for a Real-World Cyclic Train Scheduling Problem</title>
    <parentTitle language="eng">Hybrid Metaheuristics, 4th International Workshop, HM 2008, Malaga, Spain, October 8-9, 2008</parentTitle>
    <enrichment key="Series">Lecture Notes in Computer Science, Vol. 5296</enrichment>
    <author>Prasanna Balaprakash</author>
    <editor>María J. Aguilera</editor>
    <author>Armin Fügenschuh</author>
    <author>Henning Homfeld</author>
    <author>Michael Schoch</author>
    <author>Thomas Stützle</author>
    <author>Zhi Yuan</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2940</id>
    <completedYear>2008</completedYear>
    <publishedYear>2008</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>97</pageFirst>
    <pageLast>106</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Das ANSLC-Programm und das SDM im Vergleich</title>
    <parentTitle language="eng">Sonderforschungsbereich 666</parentTitle>
    <author>Chalid Dsoki</author>
    <editor>P. Groche</editor>
    <author>Armin Fügenschuh</author>
    <author>Holger Hanselka</author>
    <author>Dorit Hochbaum</author>
    <author>Irma Hernandez-Magallanes</author>
    <author>Erick Moreno-Centeno</author>
    <author>Andrea Peter</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2939</id>
    <completedYear>2009</completedYear>
    <publishedYear>2009</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">The Transport PDE and Mixed-Integer Linear Programming</title>
    <parentTitle language="eng">Dagstuhl Seminar Proceedings 09261, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Deutschland</parentTitle>
    <enrichment key="PeerReviewed">no</enrichment>
    <author>Armin Fügenschuh</author>
    <editor>Cynthia Barnhart</editor>
    <author>Björn ler</author>
    <editor>Uwe Clausen</editor>
    <author>Alexander Martin</author>
    <editor>Ulrich Lauther</editor>
    <author>Antonio Morsi</author>
    <editor>Rolf Möhring</editor>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2941</id>
    <completedYear>2008</completedYear>
    <publishedYear>2008</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>17</pageFirst>
    <pageLast>28</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Verfeinerte Modelle zur Topologie- und Geometrie-Optimierung von Blechprofilen mit Kammern</title>
    <parentTitle language="eng">Sonderforschungsbereich 666</parentTitle>
    <author>Armin Fügenschuh</author>
    <editor>P. Groche</editor>
    <author>Wolfgang Hess</author>
    <author>Lars Schewe</author>
    <author>Alexander Martin</author>
    <author>Stefan Ulbrich</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>4718</id>
    <completedYear/>
    <publishedYear>2014</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>article</type>
    <publisherName>Taylor &amp; Francis</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Validation of Nominations in Gas Network Optimization: Models, Methods, and Solutions</title>
    <abstract language="eng">In this article we investigate methods to solve a fundamental task in gas transportation, namely the validation of nomination problem: Given a gas transmission network consisting of passive pipelines and active, controllable elements and given an amount of gas at every entry and exit point of the network, find operational settings for all active elements such that there exists a network state meeting all physical, technical, and legal constraints.&#13;
&#13;
We describe a two-stage approach to solve the resulting complex and numerically difficult feasibility problem. The first phase consists of four distinct algorithms applying linear, and methods for complementarity constraints to compute possible settings for the discrete decisions. The second phase employs a precise continuous programming model of the gas network. Using this setup, we are able to compute high quality solutions to real-world industrial instances that are significantly larger than networks that have appeared in the mathematical programming literature before.</abstract>
    <parentTitle language="eng">Optimization Methods and Software</parentTitle>
    <identifier type="doi">10.1080/10556788.2014.888426</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-16531</enrichment>
    <submitter>Robert Schwarz</submitter>
    <author>Marc Pfetsch</author>
    <author>Armin Fügenschuh</author>
    <author>Björn Geißler</author>
    <author>Nina Geißler</author>
    <author>Ralf Gollmer</author>
    <author>Benjamin Hiller</author>
    <author>Jesco Humpola</author>
    <author>Thorsten Koch</author>
    <author>Thomas Lehmann</author>
    <author>Alexander Martin</author>
    <author>Antonio Morsi</author>
    <author>Jessica Rövekamp</author>
    <author>Lars Schewe</author>
    <author>Martin Schmidt</author>
    <author>Rüdiger Schultz</author>
    <author>Robert Schwarz</author>
    <author>Jonas Schweiger</author>
    <author>Claudia Stangl</author>
    <author>Marc Steinbach</author>
    <author>Stefan Vigerske</author>
    <author>Bernhard Willert</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="persons" number="vigerske">Vigerske, Stefan</collection>
    <collection role="persons" number="schweiger">Schweiger, Jonas</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>4832</id>
    <completedYear/>
    <publishedYear>2011</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>346</pageFirst>
    <pageLast>351</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Gas Network Topology Optimization for Upcoming Market Requirements</title>
    <abstract language="eng">Gas distribution networks are complex structures that consist of passive pipes, and active, controllable elements such as valves and compressors. Controlling such network means to find a suitable setting for all active components such that a nominated amount of gas can be transmitted from entries to exits through the network, without violating physical or operational constraints. The control of a large-scale gas network is a challenging task from a practical point of view. In most companies the actual controlling process is supported by means of computer software that is able to simulate the flow of the gas. However, the active settings have to be set manually within such simulation software. The solution quality thus depends on the experience of a human planner. When the gas network is insufficient for the transport then topology extensions come into play. Here a set of new pipes or active elements is determined such that the extended network admits a feasible control again. The question again is how to select these extensions and where to place them such that the total extension costs are minimal. Industrial practice is again to use the same simulation software, determine extensions by experience, add them to the virtual network, and then try to find a feasible control of the active elements. The validity of this approach now depends even more on the human planner. Another weakness of this manual simulation-based approach is that it cannot establish infeasibility of a certain gas nomination, unless all settings of the active elements are tried. Moreover, it is impossible to find a cost-optimal network extension in this way. In order to overcome these shortcomings of the manual planning approach we present a new approach, rigorously based on mathematical optimization. Hereto we describe a model for finding feasible controls and then extend this model such that topology extensions can additionally and simultaneously be covered. Numerical results for real-world instances are presented and discussed.</abstract>
    <parentTitle language="eng">International Conference on the European Energy Market (EEM)</parentTitle>
    <identifier type="doi">10.1109/EEM.2011.5953035</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-12348</enrichment>
    <submitter>Jonas Schweiger</submitter>
    <author>Armin Fügenschuh</author>
    <author>Benjamin Hiller</author>
    <author>Jesco Humpola</author>
    <author>Thorsten Koch</author>
    <author>Thomas Lehmann</author>
    <author>Robert Schwarz</author>
    <author>Jonas Schweiger</author>
    <author>Jacint Szabo</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="institutes" number="mip">Mathematical Optimization Methods</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="persons" number="koch">Koch, Thorsten</collection>
    <collection role="projects" number="MODAL-GasLab">MODAL-GasLab</collection>
    <collection role="projects" number="ForNe">ForNe</collection>
    <collection role="projects" number="MODAL-Gesamt">MODAL-Gesamt</collection>
    <collection role="persons" number="schweiger">Schweiger, Jonas</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>4822</id>
    <completedYear/>
    <publishedYear>2013</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>536</pageFirst>
    <pageLast>541</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>Universitätsverlag der TU Berlin</publisherName>
    <publisherPlace>Berlin</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Production Planning for Non-Cooperating Companies with Nonlinear Optimization</title>
    <abstract language="eng">We consider a production planning problem where two competing companies are selling their items on a common market. Moreover, the raw material used in the production is a limited non-renewable resource. The revenue per item sold depends on the total amount of items produced by both players. If they collaborate they could apply a production strategy that leads to the highest combined revenue. Usually the formation of such syndicates is prohibited by law; hence we assume that one company does not know how much the other company will produce. We formulate the problem for company A to find an optimal production plan without information on the strategy of company B as a nonlinear mathematical optimization problem. In its naive formulation the model is too large, making its solution practically impossible. After a reformulation we find a much smaller model, which we solve by spatial branch-and-cut methods and linear programming. We discuss the practical implications of our solutions.</abstract>
    <parentTitle language="eng">11th Global Conference on Sustainable Manufacturing : Proceedings</parentTitle>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-18163</enrichment>
    <author>Armin Fügenschuh</author>
    <submitter>Ingmar Vierhaus</submitter>
    <author>Roel van Veldhuizen</author>
    <author>Ingmar Vierhaus</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="projects" number="CRC1026">CRC1026</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>4823</id>
    <completedYear/>
    <publishedYear>2013</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>530</pageFirst>
    <pageLast>535</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>Universitätsverlag der TU Berlin</publisherName>
    <publisherPlace>Berlin</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">System Dynamic Optimization in the Sustainability Assessment of a World-Model</title>
    <abstract language="eng">The System Dynamics (SD) methodology is a framework for modeling and simulating the dynamic behavior of socioeconomic systems. Characteristic for the description of such systems is the occurrence of feedback loops together with stocks and flows. The mathematical equations that describe the system are usually nonlinear. Therefore seemingly simple systems can show a nonintuitive, nonpredictable behavior over time. Controlling a dynamical system means to define a desired final state in which the system should be, and to specify potential interventions from outside that should keep the system on the right track. The central question is how to compute such globally optimal control for a given SD model. We propose a branch-and-bound approach that is based on a bound propagation method, primal heuristics, and spatial branching. We apply our new SD-control method to a small System Dynamics model, that describes the evolution of a social-economic system over time. We examine the problem of steering this system on a sustainable consumption path.</abstract>
    <parentTitle language="eng">11th Global Conference on Sustainable Manufacturing : Proceedings</parentTitle>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-18148</enrichment>
    <author>Armin Fügenschuh</author>
    <submitter>Ingmar Vierhaus</submitter>
    <author>Ingmar Vierhaus</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="projects" number="CRC1026">CRC1026</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>4816</id>
    <completedYear/>
    <publishedYear>2013</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>561</pageFirst>
    <pageLast>566</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>Universitätsverlag der TU Berlin</publisherName>
    <publisherPlace>Berlin</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A System Dynamic Enhancement for the Scenario Technique</title>
    <abstract language="eng">The Scenario Technique is a strategic planning method that aims to describe and analyze potential developments of a considered system in the future. Its application consists of several steps, from an initial problem analysis over an influence analysis to projections of key factors and a definition of the scenarios to a final interpretation of the results. The technique itself combines qualitative and quantitative methods and is an enhancement of the standard Scenario Technique. We use the numerical values gathered during the influence analysis, and embed them in a System Dynamics framework. This yields a mathematically rigorous way to achieve predictions of the system‘s future behavior from an initial impulse and the feedback structure of the factors. The outcome of our new method is a further way of projecting the present into the future, which enables the user of the Scenario Technique to obtain a validation of the results achieved by the standard method.</abstract>
    <parentTitle language="eng">Proc. 11th Global Conference on Sustainable Manufacturing</parentTitle>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-18150</enrichment>
    <author>Achim Brose</author>
    <submitter>Ingmar Vierhaus</submitter>
    <author>Armin Fügenschuh</author>
    <author>Pia Gausemeier</author>
    <author>Ingmar Vierhaus</author>
    <author>Günther Seliger</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="projects" number="CRC1026">CRC1026</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>4817</id>
    <completedYear/>
    <publishedYear>2013</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>523</pageFirst>
    <pageLast>531</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Identification of trade-offs for sustainable manufacturing of a Bamboo Bike by System Dynamics</title>
    <abstract language="eng">We develop a generic System Dynamic model to simulate the production, machines, employees, waste, and capital flows of a manufacturing company. In a second step, this model is specialised by defining suit-able input data to represent a bicycle manufacturing company in a developing country. We monitor a set of sustainability indicators to understand the social, environmental and economic impact of the company, and to estimate managerial decisions to be taken in order to improve on these criteria. We show that the social and environmental situation can be improved over time without sacrificing the economic success of the company's business.</abstract>
    <parentTitle language="eng">Proceedings of the 27. Conference on Environmental Informatics - Informatics for Environmental Protection, Sustainable Development and Risk Management</parentTitle>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-18895</enrichment>
    <enrichment key="PeerReviewed">no</enrichment>
    <author>René Scheumann</author>
    <submitter>Ingmar Vierhaus</submitter>
    <author>Ingmar Vierhaus</author>
    <author>Ya-Ju Chang</author>
    <author>Armin Fügenschuh</author>
    <author>Matthias Finkbeiner</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="projects" number="CRC1026">CRC1026</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>4800</id>
    <completedYear/>
    <publishedYear>2012</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>538</pageFirst>
    <pageLast>545</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Global Manufacturing: How to Use Mathematical Optimisation Methods to Transform to Sustainable Value Creation</title>
    <parentTitle language="eng">Proceedings of the 10th Global Conference on Sustainable Manufacturing</parentTitle>
    <subTitle language="eng">(GCSM 2012)</subTitle>
    <identifier type="isbn">978-605-63463-1-6</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-15703</enrichment>
    <author>René Scheumann</author>
    <submitter>Sebastian Schenker</submitter>
    <editor>Günther Seliger</editor>
    <author>Armin Fügenschuh</author>
    <author>Sebastian Schenker</author>
    <author>Ingmar Vierhaus</author>
    <author>Ralf Borndörfer</author>
    <author>Matthias Finkbeiner</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="institutes" number="traffic">Mathematics of Transportation and Logistics</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="projects" number="CRC1026">CRC1026</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>4738</id>
    <completedYear/>
    <publishedYear>2013</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>449</pageFirst>
    <pageLast>473</pageLast>
    <pageNumber/>
    <edition/>
    <issue>3</issue>
    <volume>5</volume>
    <type>article</type>
    <publisherName>Springer Berlin Heidelberg</publisherName>
    <publisherPlace>Berlin</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Mathematical optimization for challenging network planning problems in unbundled liberalized gas markets</title>
    <abstract language="eng">The recently imposed new gas market liberalization rules in Germany lead to a change of business of gas network operators. While previously network operator and gas vendor were united, they were forced to split up into independent companies. The network has to be open to any other gas trader at the same conditions, and free network capacities have to be identified and publicly offered in a non-discriminatory way. We discuss how these changing paradigms lead to new and challenging mathematical optimization problems. This includes the validation of nominations, that asks for the decision if the network’s capacity is sufficient to transport a specific amount of flow, the verification of booked capacities and the detection of available freely allocable capacities, and the topological extension of the network with new pipelines or compressors in order to increase its capacity. In order to solve each of these problems and to provide meaningful results for the practice, a mixture of different mathematical aspects have to be addressed, such as combinatorics, stochasticity, uncertainty, and nonlinearity. Currently, no numerical solver is available that can deal with such blended problems out-of-the-box. The main goal of our research is to develop such a solver, that moreover is able to solve instances of realistic size. In this article, we describe the main ingredients of our prototypical software implementations.</abstract>
    <parentTitle language="eng">Energy Systems</parentTitle>
    <identifier type="doi">10.1007/s12667-013-0099-8</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-17821</enrichment>
    <author>Armin Fügenschuh</author>
    <submitter> Humpola</submitter>
    <author>Björn Geißler</author>
    <author>Ralf Gollmer</author>
    <author>Christine Hayn</author>
    <author>René Henrion</author>
    <author>Benjamin Hiller</author>
    <author>Jesco Humpola</author>
    <author>Thorsten Koch</author>
    <author>Thomas Lehmann</author>
    <author>Alexander Martin</author>
    <author>Radoslava Mirkov</author>
    <author>Antonio Morsi</author>
    <author>Werner Römisch</author>
    <author>Jessica Rövekamp</author>
    <author>Lars Schewe</author>
    <author>Martin Schmidt</author>
    <author>Rüdiger Schultz</author>
    <author>Robert Schwarz</author>
    <author>Jonas Schweiger</author>
    <author>Claudia Stangl</author>
    <author>Marc Steinbach</author>
    <author>Bernhard Willert</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="MODAL-GasLab">MODAL-GasLab</collection>
    <collection role="projects" number="ForNe">ForNe</collection>
    <collection role="projects" number="MODAL-Gesamt">MODAL-Gesamt</collection>
    <collection role="persons" number="schweiger">Schweiger, Jonas</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>4311</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-11-21</completedDate>
    <publishedDate>2013-11-21</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Primal Heuristic for MINLP based on Dual Information</title>
    <abstract language="eng">We present a novel heuristic algorithm to identify feasible solutions of a mixed-integer nonlinear programming problem arising in natural gas transportation: the selection of new pipelines to enhance the network's capacity to a desired level in a cost-efficient way. We solve this problem in a linear programming based branch-and-cut approach, where we deal with the nonlinearities by linear outer approximation and spatial branching. At certain nodes of the branching tree, we compute a KKT point for a nonlinear relaxation. Based on the information from the KKT point we alter some of the integer variables in a locally promising way. We describe this heuristic for general MINLPs and then show how to tailor the heuristic to exploit our problem-specific structure. On a test set of real-world instances, we are able to increase the chance of identifying feasible solutions by some order of magnitude compared to standard MINLP heuristics that are already built in the general-purpose MINLP solver SCIP.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-43110</identifier>
    <identifier type="doi">10.1007/s13675-014-0029-0</identifier>
    <enrichment key="SourceTitle">Appeared under the title "A primal heuristic for optimizing the topology of gas networks based on dual information" in: EURO Journal on Computational Optimization 2014</enrichment>
    <author>Jesco Humpola</author>
    <submitter>Armin Fügenschuh</submitter>
    <author>Armin Fügenschuh</author>
    <author>Thomas Lehmann</author>
    <series>
      <title>ZIB-Report</title>
      <number>13-49</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Mixed-Integer Nonlinear Programming</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Relaxations</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Heuristics</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Duality</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Nonlinear Network Design Applications</value>
    </subject>
    <collection role="msc" number="90-XX">OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="projects" number="MODAL-GasLab">MODAL-GasLab</collection>
    <collection role="projects" number="ForNe">ForNe</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/4311/ZR-13-49.pdf</file>
  </doc>
  <doc>
    <id>4293</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-10-22</completedDate>
    <publishedDate>2013-10-22</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Global Approach to the Control of an Industry Structure System Dynamics Model</title>
    <abstract language="eng">We consider a system dynamics model that describes the effect of human activity on natural resources. The central stocks are the accumulated profit, the industry structures, and the water resources. The model can be controlled through two time-dependent parameters. The goal in this paper is to find a parameter setting that leads to a maximization of a performance index, which reflects both environmental and economic aspects. Thus, the goal is to identify the most sustainable stock of industry structures within the model's constraints and assumptions. In order to find a proven global optimal parameter set, we formulate the System Dynamics Optimization model as a mixed-integer nonlinear problem that is accessible for numerical solvers. Due to the dynamic structure of the model, certain steps of the solution process must be handled with greater care, compared to standard non-dynamic problems. We describe our approach of solving the industry structure model and present computational results. In addition, we discuss the limitations of the approach and next steps.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-42932</identifier>
    <author>Armin Fügenschuh</author>
    <submitter>Armin Fügenschuh</submitter>
    <author>Stefan N. Grösser</author>
    <author>Ingmar Vierhaus</author>
    <series>
      <title>ZIB-Report</title>
      <number>13-67</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>System Dynamics; Mixed-Integer Nonlinear Optimization</value>
    </subject>
    <collection role="ccs" number="G.">Mathematics of Computing</collection>
    <collection role="msc" number="90-XX">OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING</collection>
    <collection role="msc" number="93-XX">SYSTEMS THEORY; CONTROL (For optimal control, see 49-XX)</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="projects" number="CRC1026">CRC1026</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/4293/ZR-13-67.pdf</file>
  </doc>
  <doc>
    <id>2936</id>
    <completedYear>2010</completedYear>
    <publishedYear>2010</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>320</pageFirst>
    <pageLast>331</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Scenario Technique with Integer Programming for Sustainability in Manufacturing</title>
    <parentTitle language="eng">8th International Heinz Nixdorf Symposium, Changing Paradigms</parentTitle>
    <enrichment key="Series">Lecture Notes in Business Information Processing</enrichment>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Armin Fügenschuh</author>
    <editor>W. Dangelmaier</editor>
    <author>Pia Gausemeier</author>
    <author>Günther Seliger</author>
    <author>Semih Severengiz</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2935</id>
    <completedYear>2010</completedYear>
    <publishedYear>2010</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">Mixed-Integer Nonlinear Problems in Transportation Applications</title>
    <parentTitle language="eng">Proceedings of the 2nd International Conference on Engineering Optimization (+CD-rom)</parentTitle>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Armin Fügenschuh</author>
    <editor>H. Rodrigues</editor>
    <author>Henning Homfeld</author>
    <author>Hanno Schülldorf</author>
    <author>Stefan Vigerske</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="persons" number="vigerske">Vigerske, Stefan</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2937</id>
    <completedYear>2010</completedYear>
    <publishedYear>2010</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">New Discretization and Optimization Techniques with Results in the Dynamics of Gene-Environment Networks</title>
    <parentTitle language="eng">3rd Global Conference on Power Control and Optimization (PCO 2010)</parentTitle>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Armin Fügenschuh</author>
    <author>Özlem Defterli</author>
    <author>Gehard-Wilhelm Weber</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2938</id>
    <completedYear>2009</completedYear>
    <publishedYear>2009</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">Single Car Routing in Rail Freight Transport</title>
    <parentTitle language="eng">Dagstuhl Seminar Proceedings 09261, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Deutschland</parentTitle>
    <enrichment key="PeerReviewed">no</enrichment>
    <author>Armin Fügenschuh</author>
    <editor>Cynthia Barnhart</editor>
    <author>Henning Homfeld</author>
    <editor>Uwe Clausen</editor>
    <author>Hanno Schülldorf</author>
    <editor>Ulrich Lauther</editor>
    <editor>Rolf Möhring</editor>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>5376</id>
    <completedYear/>
    <publishedYear>2016</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>597</pageFirst>
    <pageLast>631</pageLast>
    <pageNumber/>
    <edition/>
    <issue>3</issue>
    <volume>38</volume>
    <type>article</type>
    <publisherName>Springer</publisherName>
    <publisherPlace>Berlin Heidelberg</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Valid inequalities for the topology optimization problem in gas network design</title>
    <abstract language="eng">One quarter of Europe's energy demand is provided by natural gas distributed through a vast pipeline network covering the whole of Europe. At a cost of 1 million Euro per km extending the European pipeline network is already a multi-billion Euro business. Therefore, automatic planning tools that support the decision process are desired. Unfortunately, current mathematical methods are not capable of solving the arising network design problems due to their size and complexity. In this article, we will show how to apply optimization methods that can converge to a proven global optimal solution. By introducing a new class of valid inequalities that improve the relaxation of our mixed-integer nonlinear programming model, we are able to speed up the necessary computations substantially.</abstract>
    <parentTitle language="eng">OR Spectrum</parentTitle>
    <identifier type="doi">https://doi.org/10.1007/s00291-015-0390-2</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-17771</enrichment>
    <author>Jesco Humpola</author>
    <submitter>Jesco Humpola</submitter>
    <author>Armin Fügenschuh</author>
    <author>Thorsten Koch</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="MODAL-GasLab">MODAL-GasLab</collection>
    <collection role="projects" number="ForNe">ForNe</collection>
    <collection role="projects" number="MODAL-Gesamt">MODAL-Gesamt</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>5812</id>
    <completedYear/>
    <publishedYear>2016</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>408</pageFirst>
    <pageLast>423</pageLast>
    <pageNumber/>
    <edition/>
    <issue>2</issue>
    <volume>50</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">The Freight Train Routing Problem for Congested Railway Networks with Mixed Traffic</title>
    <abstract language="eng">We consider the following freight train routing problem (FTRP).&#13;
Given is a transportation network with fixed routes for passenger&#13;
trains and a set of freight trains (requests), each defined by an&#13;
origin and destination station pair. The objective is to&#13;
calculate a feasible route for each freight train such that the&#13;
sum of all expected delays and all running times is minimal.&#13;
Previous research concentrated on microscopic train routings for&#13;
junctions or inside major stations. Only recently approaches were&#13;
developed to tackle larger corridors or even networks. We&#13;
investigate the routing problem from a strategic perspective,&#13;
calculating the routes in a macroscopic transportation network of&#13;
Deutsche Bahn AG. In this context, macroscopic refers to an&#13;
aggregation of complex and large real-world structures into fewer&#13;
network elements. Moreover, the departure and arrival times of&#13;
freight trains are approximated. The problem has a strategic&#13;
character since it asks only for a coarse routing through the&#13;
network without the precise timings. We provide a mixed-integer&#13;
nonlinear programming (MINLP) formulation for the FTRP, which is&#13;
a multicommodity flow model on a time-expanded graph with&#13;
additional routing constraints. The model’s nonlinearities&#13;
originate from an algebraic approximation of the delays of the&#13;
trains on the arcs of the network by capacity restraint&#13;
functions. The MINLP is reduced to a mixed-integer linear&#13;
model (MILP) by piecewise linear approximation. The latter is&#13;
solved by a state-of-the art MILP solver for various real-world&#13;
test instances.</abstract>
    <parentTitle language="eng">Transportation Science</parentTitle>
    <identifier type="doi">10.1287/trsc.2015.0656</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="SubmissionStatus">in press</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-18991</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Torsten Klug</submitter>
    <author>Armin Fügenschuh</author>
    <author>Torsten Klug</author>
    <author>Thilo Schang</author>
    <author>Thomas Schlechte</author>
    <author>Hanno Schülldorf</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="institutes" number="traffic">Mathematics of Transportation and Logistics</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="persons" number="klug">Klug, Torsten</collection>
    <collection role="persons" number="schlechte">Schlechte, Thomas</collection>
    <collection role="projects" number="KOSMOS">KOSMOS</collection>
    <collection role="projects" number="MODAL-RailLab">MODAL-RailLab</collection>
    <collection role="projects" number="MODAL-Gesamt">MODAL-Gesamt</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2964</id>
    <completedYear>2010</completedYear>
    <publishedYear>2010</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>EP 09 718 564.9</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Steuerung einer Sortieranlage, z.B. für Altpapier</title>
    <parentTitle language="eng">Europäische Patentanmeldung</parentTitle>
    <enrichment key="PeerReviewed">no</enrichment>
    <author>Mirjam Dür</author>
    <author>Armin Fügenschuh</author>
    <author>Alexander Martin</author>
    <author>Samuel Schabel</author>
    <author>Christine Schönberger</author>
    <author>Klaus Villforth</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2933</id>
    <completedYear>2006</completedYear>
    <publishedYear>2006</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1155</pageFirst>
    <pageLast>1176</pageLast>
    <pageNumber/>
    <edition/>
    <issue>4</issue>
    <volume>16</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Combinatorial and Continuous Models and Optimization for Traffic Flow on Networks</title>
    <parentTitle language="eng">SIAM Journal on Optimization</parentTitle>
    <author>Armin Fügenschuh</author>
    <author>Michael Herty</author>
    <author>Axel Klar</author>
    <author>Alexander Martin</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2934</id>
    <completedYear>2005</completedYear>
    <publishedYear>2005</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>281</pageFirst>
    <pageLast>287</pageLast>
    <pageNumber/>
    <edition/>
    <issue>6</issue>
    <volume>49</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Integrierte Optimierung des ÖPNV-Angebots und der Schulanfangszeiten</title>
    <parentTitle language="eng">Straß enverkehrstechnik</parentTitle>
    <author>Armin Fügenschuh</author>
    <author>Peter Stöveken</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2932</id>
    <completedYear>2006</completedYear>
    <publishedYear>2006</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>50</pageFirst>
    <pageLast>54</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>129</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Welche Gemeinsamkeiten haben Jugendliche und Groß banken?</title>
    <parentTitle language="eng">mathematiklehren</parentTitle>
    <author>Armin Fügenschuh</author>
    <author>Alexander Martin</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2965</id>
    <completedYear>2008</completedYear>
    <publishedYear>2008</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>DE 10 2008 013 034</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Verfahren zum Einstellen und/oder Optimieren einer einen Gutstoff von einem Schlechtstoff trennenden Sortieranlage und Sortieranlage</title>
    <parentTitle language="eng">Deutsches Patent</parentTitle>
    <author>Mirjam Dür</author>
    <author>Armin Fügenschuh</author>
    <author>Alexander Martin</author>
    <author>Samuel Schabel</author>
    <author>Christine Schönberger</author>
    <author>Klaus Villforth</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2967</id>
    <completedYear>2004</completedYear>
    <publishedYear>2004</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>DE 10 2004 020 786.0</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Verfahren und Vorrichtung zur automatischen Optimierung von Schulanfangszeiten und des öffentlichen Personenverkehrs und entsprechendes Computerprogramm</title>
    <parentTitle language="eng">Deutsche Patentanmeldung</parentTitle>
    <author>Armin Fügenschuh</author>
    <author>Alexander Martin</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2966</id>
    <completedYear>2006</completedYear>
    <publishedYear>2006</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>DE 10 2006 060 583.7</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Verfahren und Vorrichtung zum Auswuchten von wellenelastischen Rotoren</title>
    <parentTitle language="eng">Deutsche Patentanmeldung</parentTitle>
    <author>Mirjam Dür</author>
    <author>Armin Fügenschuh</author>
    <author>Alexander Martin</author>
    <author>Stefan Ulbrich</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2931</id>
    <completedYear>2006</completedYear>
    <publishedYear>2006</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>157</pageFirst>
    <pageLast>176</pageLast>
    <pageNumber/>
    <edition/>
    <issue>2</issue>
    <volume>14</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">The Vehicle Routing Problem with Coupled Time Windows</title>
    <parentTitle language="eng">Central European Journal of Operations Research</parentTitle>
    <author>Armin Fügenschuh</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2925</id>
    <completedYear>2009</completedYear>
    <publishedYear>2009</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>427</pageFirst>
    <pageLast>445</pageLast>
    <pageNumber/>
    <edition/>
    <issue>3</issue>
    <volume>24</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">MIP Presolve Techniques for a PDE-based Supply Chain Model</title>
    <parentTitle language="eng">Optimization Methods &amp; Software</parentTitle>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Agnes Dittel</author>
    <author>Armin Fügenschuh</author>
    <author>Simone Göttlich</author>
    <author>Michael Herty</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2970</id>
    <completedYear>2009</completedYear>
    <publishedYear>2009</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1</pageFirst>
    <pageLast>6</pageLast>
    <pageNumber/>
    <edition/>
    <issue>1</issue>
    <volume>20</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Scheduling School Starting Times and Public Buses</title>
    <parentTitle language="eng">SIAG/OPT Views-and-News</parentTitle>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Armin Fügenschuh</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2924</id>
    <completedYear>2009</completedYear>
    <publishedYear>2009</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>245</pageFirst>
    <pageLast>265</pageLast>
    <pageNumber/>
    <edition/>
    <issue>3</issue>
    <volume>85</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Efficient Reformulation and Solution of a Nonlinear PDE-Controlled Flow Network Model</title>
    <parentTitle language="eng">Computing</parentTitle>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Armin Fügenschuh</author>
    <author>Simone Göttlich</author>
    <author>Claus Kirchner</author>
    <author>Michael Herty</author>
    <author>Alexander Martin</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2923</id>
    <completedYear>2010</completedYear>
    <publishedYear>2010</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>143</pageFirst>
    <pageLast>162</pageLast>
    <pageNumber/>
    <edition/>
    <issue>1</issue>
    <volume>5</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">The Coolest Path Problem</title>
    <parentTitle language="eng">Networks and Heterogeneous Media</parentTitle>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-11571</enrichment>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Martin Frank</author>
    <author>Armin Fügenschuh</author>
    <author>Michael Herty</author>
    <author>Lars Schewe</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2971</id>
    <completedYear>2007</completedYear>
    <publishedYear>2007</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>19</pageFirst>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>2</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Spalten am Stück – Maschinenbauer, Materialwissenschaftler und Mathematiker erfinden die Blechbearbeitung neu</title>
    <parentTitle language="eng">hoch$^3$</parentTitle>
    <author>Armin Fügenschuh</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2972</id>
    <completedYear>2007</completedYear>
    <publishedYear>2007</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>20</pageFirst>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>2</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Bestes Blech – Der hochkomplexe unsichtbare Weg zum präzisen und belastbaren Bauteil</title>
    <parentTitle language="eng">hoch$^3$</parentTitle>
    <author>Armin Fügenschuh</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2929</id>
    <completedYear>2008</completedYear>
    <publishedYear>2008</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1490</pageFirst>
    <pageLast>1507</pageLast>
    <pageNumber/>
    <edition/>
    <issue>3</issue>
    <volume>30</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Discrete Optimization Approach to Large Scale Supply Networks Based on Partial Differential Equations</title>
    <parentTitle language="eng">SIAM Journal on Scientific Computing</parentTitle>
    <author>Armin Fügenschuh</author>
    <author>Simone Göttlich</author>
    <author>Michael Herty</author>
    <author>Alexander Klar</author>
    <author>Alexander Martin</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2927</id>
    <completedYear>2008</completedYear>
    <publishedYear>2008</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>1</pageFirst>
    <pageLast>14</pageLast>
    <pageNumber/>
    <edition/>
    <issue>4</issue>
    <volume>42</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Scheduling Locomotives and Car Transfers in Freight Transport</title>
    <parentTitle language="eng">Transportation Science</parentTitle>
    <author>Armin Fügenschuh</author>
    <author>Henning Homfeld</author>
    <author>Andreas Huck</author>
    <author>Alexander Martin</author>
    <author>Zhi Yuan</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2928</id>
    <completedYear>2008</completedYear>
    <publishedYear>2008</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>313</pageFirst>
    <pageLast>331</pageLast>
    <pageNumber/>
    <edition/>
    <issue>2</issue>
    <volume>68</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Integer Linear Programming Models for Topology Optimization in Sheet Metal Design</title>
    <parentTitle language="eng">Mathematical Methods of Operations Research</parentTitle>
    <author>Armin Fügenschuh</author>
    <author>Marzena Fügenschuh</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2926</id>
    <completedYear>2009</completedYear>
    <publishedYear>2009</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>867</pageFirst>
    <pageLast>884</pageLast>
    <pageNumber/>
    <edition/>
    <issue>3</issue>
    <volume>193</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Solving a School Bus Scheduling Problem with Integer Programming</title>
    <parentTitle language="eng">European Journal of Operational Research</parentTitle>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Armin Fügenschuh</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2930</id>
    <completedYear>2006</completedYear>
    <publishedYear>2006</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>199</pageFirst>
    <pageLast>216</pageLast>
    <pageNumber/>
    <edition/>
    <issue>1</issue>
    <volume>147</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Multicriterial Approach for Optimizing Bus Schedules and School Starting Times</title>
    <parentTitle language="eng">Annals of Operations Research</parentTitle>
    <author>Armin Fügenschuh</author>
    <author>Alexander Martin</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2976</id>
    <completedYear>2006</completedYear>
    <publishedYear>2006</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>82</pageFirst>
    <pageLast>85</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>1</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Optimal verknüpft - Schulanfangszeiten und öffentlicher Personennahverkehr</title>
    <parentTitle language="eng">thema forschung</parentTitle>
    <author>Armin Fügenschuh</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2973</id>
    <completedYear>2006</completedYear>
    <publishedYear>2006</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>25</pageFirst>
    <pageLast>27</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>28</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Optimierte Schulanfangszeiten</title>
    <parentTitle language="eng">OR News</parentTitle>
    <author>Armin Fügenschuh</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</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>2977</id>
    <completedYear>2006</completedYear>
    <publishedYear>2006</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>3</pageFirst>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>1</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Mathematische Modelle zur betrieblichen Optimierung</title>
    <parentTitle language="eng">Z! - das Zukunftsmagazin</parentTitle>
    <author>Armin Fügenschuh</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>1257</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-04-11</completedDate>
    <publishedDate>2011-04-11</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Polyhedral Aspects of Self-Avoiding Walks</title>
    <abstract language="eng">In this paper, we study self-avoiding walks of a given length on a graph. We consider a formulation of this problem as a binary linear program. We analyze the polyhedral structure of the underlying polytope and describe valid inequalities. Proofs for their facial properties for certain special cases are given. In a variation of this problem one is interested in optimal configurations, where an energy function measures the benefit if certain path elements are placed on adjacent vertices of the graph. The most prominent application of this problem is the protein folding problem in biochemistry. On a set of selected instances, we demonstrate the computational merits of our approach.</abstract>
    <identifier type="serial">11-11</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-12576</identifier>
    <author>Agnes Dittel</author>
    <submitter>Armin Fügenschuh</submitter>
    <author>Armin Fügenschuh</author>
    <author>Alexander Martin</author>
    <series>
      <title>ZIB-Report</title>
      <number>11-11</number>
    </series>
    <subject>
      <language/>
      <type>uncontrolled</type>
      <value>Polyhedral Combinatorics</value>
    </subject>
    <subject>
      <language/>
      <type>uncontrolled</type>
      <value>Integer Programming</value>
    </subject>
    <subject>
      <language/>
      <type>uncontrolled</type>
      <value>Self-Avoiding Path</value>
    </subject>
    <subject>
      <language/>
      <type>uncontrolled</type>
      <value>Protein Folding</value>
    </subject>
    <collection role="msc" number="05C38">Paths and cycles [See also 90B10]</collection>
    <collection role="msc" number="90C10">Integer programming</collection>
    <collection role="msc" number="90C57">Polyhedral combinatorics, branch-and-bound, branch-and-cut</collection>
    <collection role="msc" number="92D20">Protein sequences, DNA sequences</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1257/DittelFuegenschuhMartin2011.pdf</file>
  </doc>
  <doc>
    <id>5467</id>
    <completedYear/>
    <publishedYear>2015</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>717</pageFirst>
    <pageLast>759</pageLast>
    <pageNumber/>
    <edition/>
    <issue>3</issue>
    <volume>62</volume>
    <type>article</type>
    <publisherName>Springer US</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Convex reformulations for solving a nonlinear network design problem</title>
    <abstract language="eng">We consider a nonlinear nonconvex network design problem that arises, for example, in natural gas or water transmission networks. Given is such a network with active and passive components, that is, valves, compressors, control valves (active) and pipelines (passive), and a desired amount of flow at certain specified entry and exit nodes in the network. The active elements are associated with costs when used. Besides flow conservation constraints in the nodes, the flow must fulfill nonlinear nonconvex pressure loss constraints on the arcs subject to potential values (i.e., pressure levels) in both end nodes of each arc. The problem is to compute a cost minimal setting of the active components and numerical values for the flow and node potentials. We examine different (convex) relaxations for a subproblem of the design problem and benefit from them within a branch-and-bound approach. We compare different approaches based on nonlinear optimization numerically on a set of test instances.</abstract>
    <parentTitle language="eng">Computational Optimization and Applications</parentTitle>
    <identifier type="doi">10.1007/s10589-015-9756-2</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-18857</enrichment>
    <author>Jesco Humpola</author>
    <submitter>Jesco Humpola</submitter>
    <author>Armin Fügenschuh</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="projects" number="MODAL-GasLab">MODAL-GasLab</collection>
    <collection role="projects" number="ForNe">ForNe</collection>
    <collection role="projects" number="MODAL-Gesamt">MODAL-Gesamt</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>5345</id>
    <completedYear/>
    <publishedYear>2015</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>SIAM-MOS series on Optimization</volume>
    <type>bookpart</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">The Specialized MINLP Approach</title>
    <abstract language="eng">We propose an approach to solve the validation of nominations problem using mixed-integer nonlinear programming (MINLP) methods. Our approach handles both the discrete settings and the nonlinear aspects of gas physics. Our main contribution is an innovative coupling of mixed-integer (linear) programming (MILP) methods with nonlinear programming (NLP) that exploits the special structure of a suitable approximation of gas physics, resulting in a global optimization method for this type of problem.</abstract>
    <parentTitle language="eng">Evaluating Gas Network Capacities</parentTitle>
    <identifier type="isbn">9781611973686</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Jesco Humpola</author>
    <submitter>Jesco Humpola</submitter>
    <author>Armin Fügenschuh</author>
    <author>Benjamin Hiller</author>
    <author>Thorsten Koch</author>
    <author>Thomas Lehmann</author>
    <author>Ralf Lenz</author>
    <author>Robert Schwarz</author>
    <author>Jonas Schweiger</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="persons" number="lenz">Lenz, Ralf</collection>
    <collection role="projects" number="MODAL-GasLab">MODAL-GasLab</collection>
    <collection role="projects" number="ForNe">ForNe</collection>
    <collection role="projects" number="TRR154-A04">TRR154-A04</collection>
    <collection role="projects" number="MODAL-Gesamt">MODAL-Gesamt</collection>
    <collection role="persons" number="schweiger">Schweiger, Jonas</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>5359</id>
    <completedYear/>
    <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-10-02</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Fastest, average and quantile schedule</title>
    <abstract language="eng">We consider problems concerning the scheduling of a set of trains on a single track. For every pair of trains there is a minimum headway, which every train must wait before it enters the track after another train. The speed of each train is also given. Hence for every schedule - a sequence of trains - we may compute the time that is at least needed for all trains to travel along the track in the given order. We give the solution to three problems: the fastest schedule, the average schedule, and the problem of quantile schedules. The last problem is a question about the smallest upper bound on the time of a given fraction of all possible schedules. We show how these problems are related to the travelling salesman problem. We prove NP-completeness of the fastest schedule problem, NP-hardness of quantile of schedules problem, and polynomiality of the average schedule problem. We also describe some algorithms for all three problems. In the solution of the quantile problem we give an algorithm, based on a reverse search method, generating with polynomial delay all Eulerian multigraphs with the given degree sequence and a bound on the number of such multigraphs. A better bound is left as an open question.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-53592</identifier>
    <enrichment key="SourceTitle">Appeared in: SOFSEM 2015: Theory and Practice of Computer Science</enrichment>
    <author>Armin Fügenschuh</author>
    <submitter>Torsten Klug</submitter>
    <author>Konstanty Junosza-Szaniawski</author>
    <author>Torsten Klug</author>
    <author>Slawomir Kwasiborski</author>
    <author>Thomas Schlechte</author>
    <series>
      <title>ZIB-Report</title>
      <number>14-49</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>eulerian multigraphs</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>scheduling</value>
    </subject>
    <collection role="ccs" number="">Permutations and combinations</collection>
    <collection role="msc" number="05Axx">Enumerative combinatorics For enumeration in graph theory, see 05C30</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="persons" number="klug">Klug, Torsten</collection>
    <collection role="persons" number="schlechte">Schlechte, Thomas</collection>
    <collection role="projects" number="KOSMOS">KOSMOS</collection>
    <collection role="projects" number="MODAL-RailLab">MODAL-RailLab</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/5359/ZR-14-49.pdf</file>
  </doc>
  <doc>
    <id>1885</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-07-01</completedDate>
    <publishedDate>2013-07-01</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Unified View on Relaxations for a Nonlinear Network Flow Problem</title>
    <abstract language="eng">We consider a nonlinear nonconvex network flow problem that arises, for example, in natural gas or water transmission networks. Given is such network with active and passive components, that is, valves, compressors, pressure regulators (active) and pipelines (passive), and a desired amount of flow at certain specified entry and exit nodes of the network. Besides flow conservation constraints in the nodes the flow must fulfill nonlinear nonconvex pressure loss constraints on the arcs subject to potential values (i.e., pressure levels) in both end nodes of each arc. The problem is how to numerically compute this flow and pressures. We review an existing approach of Maugis (1977) and extend it to the case of networks with active elements (for example, compressors). We further examine different ways of relaxations for the nonlinear network flow model. We compare different approaches based on nonlinear optimization numerically on a set of test instances.</abstract>
    <identifier type="urn">urn:nbn:de:0297-zib-18857</identifier>
    <author>Armin Fügenschuh</author>
    <submitter>Armin Fügenschuh</submitter>
    <author>Jesco Humpola</author>
    <series>
      <title>ZIB-Report</title>
      <number>13-31</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Nonlinear Network Flow</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Mixed-Integer Nonlinear Programming</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Relaxations</value>
    </subject>
    <collection role="msc" number="90-XX">OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="projects" number="MODAL-GasLab">MODAL-GasLab</collection>
    <collection role="projects" number="ForNe">ForNe</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/1885/ZR-13-31.pdf</file>
  </doc>
  <doc>
    <id>1860</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-05-27</completedDate>
    <publishedDate>2013-05-27</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Global Approach to the Optimal Control of System Dynamics Models</title>
    <abstract language="eng">The System Dynamics (SD) methodology is a framework for modeling and simulating the dynamic behavior of socioeconomic systems. Characteristic for the description of such systems is the occurrence of feedback loops together with stocks and flows. The mathematical equations that describe the system are usually ordinary differential equations and nonlinear algebraic constraints. Therefore seemingly simple systems can show a nonintuitive, unpredictable behavior over time. Controlling a dynamical system means to specify potential interventions from outside that should keep the system on the desired track, and to define an evaluation schema to compare different controls among each other, so that a "best" control can be defined in a meaningful way. The central question is how to compute such globally optimal control for a given SD model, that allows the transition of the system into a desired state with minimum effort. We propose a mixed-integer nonlinear programming (MINLP) reformulation of the System Dynamics Optimization (SDO) problem. MINLP problems can be solved by linear programming based branch-and-bound approach. We demonstrate that standard MINLP solvers are not able to solve SDO problem. To overcome this obstacle, we introduce a special-tailored bound propagation method. We apply our new method to a predator-prey model with additional hunting activity as control, and to a mini-world model with the consumption level as control. Numerical results for these test cases are presented.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-18600</identifier>
    <author>Armin Fügenschuh</author>
    <submitter>Armin Fügenschuh</submitter>
    <author>Ingmar Vierhaus</author>
    <series>
      <title>ZIB-Report</title>
      <number>13-28</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>System Dynamics</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Global Optimal Control</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Mixed-Integer Nonlinear Optimization</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Bounds Strengthening</value>
    </subject>
    <collection role="msc" number="34-XX">ORDINARY DIFFERENTIAL EQUATIONS</collection>
    <collection role="msc" number="37-XX">DYNAMICAL SYSTEMS AND ERGODIC THEORY [See also 26A18, 28Dxx, 34Cxx, 34Dxx, 35Bxx, 46Lxx, 58Jxx, 70-XX]</collection>
    <collection role="msc" number="90-XX">OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1860/ZR-13-28.pdf</file>
  </doc>
  <doc>
    <id>1889</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-07-02</completedDate>
    <publishedDate>2013-07-02</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Identification of trade-offs for sustainable manufacturing of a Bamboo Bike by System Dynamics</title>
    <abstract language="eng">We develop a generic System Dynamic model to simulate the production, machines, employees, waste, and capital flows of a manufacturing company. In a second step, this model is specialised by defining suit-able input data to represent a bicycle manufacturing company in a developing country. We monitor a set of sustainability indicators to understand the social, environmental and economic impact of the company, and to estimate managerial decisions to be taken in order to improve on these criteria. We show that the social and environmental situation can be improved over time without sacrificing the economic success of the company's business.</abstract>
    <identifier type="urn">urn:nbn:de:0297-zib-18895</identifier>
    <enrichment key="SourceTitle">Appeared in: Proceedings of the 27th Conference on Environmental Informatics –  Informatics for Environmental Protection, Sustainable Development and Risk Management , Sept. 2-4, 2013 Univ. Hamburg, Germany. Shaker 2013. ISBN 978-3-8440-1676-5 pp. 523-531</enrichment>
    <author>René Scheumann</author>
    <submitter>Armin Fügenschuh</submitter>
    <author>Ingmar Vierhaus</author>
    <author>Ya-Ju Chang</author>
    <author>Armin Fügenschuh</author>
    <author>Matthias Finkbeiner</author>
    <series>
      <title>ZIB-Report</title>
      <number>13-32</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>System Dynamics</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Modelling</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Life Cycle Sustainability Assessment</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Sustainability Indicators</value>
    </subject>
    <collection role="msc" number="91-XX">GAME THEORY, ECONOMICS, SOCIAL AND BEHAVIORAL SCIENCES</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1889/ZR-13-32.pdf</file>
  </doc>
  <doc>
    <id>1777</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-02-16</completedDate>
    <publishedDate>2013-02-16</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A New Class of Valid Inequalities for Nonlinear Network Design Problems</title>
    <abstract language="eng">We consider a nonlinear nonconvex network design problem that arises in the extension of natural gas transmission networks. Given is such network with active and passive components, that is, valves, compressors, pressure regulators (active) and pipelines (passive), and a desired amount of flow at certain specified entry and exit nodes of the network. Besides flow conservation constraints in the nodes the flow must fulfill nonlinear nonconvex pressure loss constraints on the arcs subject to potential values (i.e., pressure levels) in both end nodes of each arc. Assume that there does not exist a feasible flow that fulfills all physical constraints and meets the desired entry and exit amounts. Then a natural question is where to extend the network by adding pipes in the most economic way such that this flow becomes feasible. Answering this question is computationally demanding because of the difficult problem structure. We use mixed-integer nonlinear programming techniques that rely on an outer approximation of the overall problem, and a branching on decision variables. We formulate a new class of valid inequalities (or cutting planes) which reduce the overall solution time when added to the formulation. We demonstrate the computational merits of our approach on test instances.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-17771</identifier>
    <identifier type="doi">10.1007/s00291-015-0390-2</identifier>
    <enrichment key="SourceTitle">Appeared in: OR Spectrum 2015</enrichment>
    <author>Jesco Humpola</author>
    <submitter>Armin Fügenschuh</submitter>
    <author>Armin Fügenschuh</author>
    <series>
      <title>ZIB-Report</title>
      <number>13-06</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Network Design</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Mixed-Integer Nonlinear Programming</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Cutting Planes</value>
    </subject>
    <collection role="msc" number="90-XX">OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="projects" number="MODAL-GasLab">MODAL-GasLab</collection>
    <collection role="projects" number="ForNe">ForNe</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/1777/FuegenschuhHumpola2012__dual_var_cuts.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/1777/ZR-13-06revisedversion.pdf</file>
  </doc>
  <doc>
    <id>2892</id>
    <completedYear>2007</completedYear>
    <publishedYear>2007</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">Leitwegeplanung</title>
    <parentTitle language="eng">Mathematik für Innovationen in Industrie und Dienstleistungen</parentTitle>
    <enrichment key="Series">BMBF Mathematikprogramm 03MAPAG3</enrichment>
    <author>Armin Fügenschuh</author>
    <author>Henning Homfeld</author>
    <author>Alexander Martin</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2921</id>
    <completedYear>2005</completedYear>
    <publishedYear>2005</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>book</type>
    <publisherName>Logos Verlag Berlin</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">The Integrated Optimization of School Starting Times and Public Bus Services</title>
    <author>Armin Fügenschuh</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>2922</id>
    <completedYear>2000</completedYear>
    <publishedYear>2000</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>masterthesis</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation>Carl von Ossietzky Universität Oldenburg</contributingCorporation>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Zur Bergman-Vollständigkeit hyperkonvexer Gebiete</title>
    <author>Armin Fügenschuh</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>1782</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-03-07</completedDate>
    <publishedDate>2013-03-07</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Mathematical Optimization for Challenging Network Planning Problems in Unbundled Liberalized Gas Markets</title>
    <abstract language="eng">The recently imposed new gas market liberalization rules in Germany lead to a change of business of gas network operators. &#13;
While previously network operator and gas vendor where united, they were forced to split up into independent companies. &#13;
The network has to be open to any other gas trader at the same conditions, and free network capacities have to be identified and publicly offered in a non-discriminatory way. &#13;
We show that these new paradigms lead to new and challenging mathematical optimization problems. &#13;
In order to solve them and to provide meaningful results for practice, all aspects of the underlying problems, such as combinatorics, stochasticity, uncertainty, and nonlinearity, have to be addressed. &#13;
With such special-tailored solvers, free network capacities and topological network extensions can, for instance, be determined.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-17821</identifier>
    <identifier type="doi">10.1007/s12667-013-0099-8</identifier>
    <enrichment key="SourceTitle">Appeared in:  Energy Systems  5 (2014) 449-473</enrichment>
    <author>Armin Fügenschuh</author>
    <submitter>Jonas Schweiger</submitter>
    <author>Björn Geißler</author>
    <author>Ralf Gollmer</author>
    <author>Christine Hayn</author>
    <author>Rene Henrion</author>
    <author>Benjamin Hiller</author>
    <author>Jesco Humpola</author>
    <author>Thorsten Koch</author>
    <author>Thomas Lehmann</author>
    <author>Alexander Martin</author>
    <author>Radoslava Mirkov</author>
    <author>Antonio Morsi</author>
    <author>Werner Römisch</author>
    <author>Jessica Rövekamp</author>
    <author>Lars Schewe</author>
    <author>Martin Schmidt</author>
    <author>Rüdiger Schultz</author>
    <author>Robert Schwarz</author>
    <author>Jonas Schweiger</author>
    <author>Claudia Stangl</author>
    <author>Marc Steinbach</author>
    <author>Bernhard Willert</author>
    <series>
      <title>ZIB-Report</title>
      <number>13-13</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Gas Market Liberalization</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Entry-Exit Model</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Gas Network Access Regulation</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Mixed-Integer Nonlinear Nonconvex Stochastic Optimization</value>
    </subject>
    <collection role="pacs" number="89.30.-g">Energy resources (see also 84.60.-h Direct energy conversion and storage)</collection>
    <collection role="msc" number="90B10">Network models, deterministic</collection>
    <collection role="msc" number="90C11">Mixed integer programming</collection>
    <collection role="msc" number="90C30">Nonlinear programming</collection>
    <collection role="msc" number="90C90">Applications of mathematical programming</collection>
    <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="MODAL-GasLab">MODAL-GasLab</collection>
    <collection role="projects" number="ForNe">ForNe</collection>
    <collection role="projects" number="MODAL-Gesamt">MODAL-Gesamt</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/1782/ZR-13-13.pdf</file>
  </doc>
  <doc>
    <id>1814</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-04-23</completedDate>
    <publishedDate>2013-04-23</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">System Dynamic Optimization in the Sustainability Assessment of a World-Model</title>
    <abstract language="eng">The System Dynamics (SD) methodology is a framework for modeling and simulating&#13;
the dynamic behavior of socioeconomic systems. Characteristic for the&#13;
description of such systems is the occurrence of feedback loops together with&#13;
stocks and flows. The mathematical equations that describe the system are&#13;
usually nonlinear. Therefore seemingly simple systems can show a nonintuitive,&#13;
nonpredictable behavior over time. Controlling a dynamical system means to&#13;
define a desired final state in which the system should be, and to specify&#13;
potential interventions from outside that should keep the system on the right&#13;
track. The central question is how to compute such globally optimal control for&#13;
a given SD model. We propose a branch-and-bound approach that is based on a&#13;
bound propagation method, primal heuristics, and spatial branching. We apply our&#13;
new SD-control method to a small System Dynamics model, that describes the&#13;
evolution of a social-economic system over time. We examine the problem of&#13;
steering this system on a sustainable consumption path.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-18148</identifier>
    <identifier type="url">http://opus4.kobv.de/opus4-tuberlin/frontdoor/index/index/docId/4026</identifier>
    <enrichment key="SourceTitle">Appeared in: Proceedings of the 11th Global Conference on Sustainable Manufacturing (GCSM2013), G. Seliger (Hrsg.), Universitätsverlag der TU Berlin, Seite 582 -- 587</enrichment>
    <author>Armin Fügenschuh</author>
    <submitter>Armin Fügenschuh</submitter>
    <author>Ingmar Vierhaus</author>
    <series>
      <title>ZIB-Report</title>
      <number>13-23</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>System Dynamics; Mixed-Integer Nonlinear Optimization</value>
    </subject>
    <collection role="msc" number="90-XX">OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="projects" number="CRC1026">CRC1026</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1814/ZR-13-23.pdf</file>
  </doc>
  <doc>
    <id>1816</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-04-23</completedDate>
    <publishedDate>2013-04-23</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Production Planning for Non-Cooperating Companies with Nonlinear Optimization</title>
    <abstract language="eng">We consider a production planning problem where two competing companies are selling their items on a common market. Moreover, the raw material used in the production is a limited non-renewable resource. The revenue per item sold depends on the total amount of items produced by both players. If they collaborate they could apply a production strategy that leads to the highest combined revenue. Usually the formation of such syndicates is prohibited by law; hence we assume that one company does not know how much the other company will produce. We formulate the problem for company A to find an optimal production plan without information on the strategy of company B as a nonlinear mathematical optimization problem. In its naive formulation the model is too large, making its solution practically impossible. After a reformulation we find a much smaller model, which we solve by spatial branch-and-cut methods and linear programming. We discuss the practical implications of our solutions.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-18163</identifier>
    <identifier type="url">http://opus4.kobv.de/opus4-tuberlin/frontdoor/index/index/docId/4026</identifier>
    <enrichment key="SourceTitle">Appeared in: Proceedings of the 11th Global Conference on Sustainable Manufacturing (GCSM2013), G. Seliger (Hrsg.), Universitätsverlag der TU Berlin, Seite 588 -- 593</enrichment>
    <author>Armin Fügenschuh</author>
    <submitter>Armin Fügenschuh</submitter>
    <author>Roel van Veldhuizen</author>
    <author>Ingmar Vierhaus</author>
    <series>
      <title>ZIB-Report</title>
      <number>13-25</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Non-Cooperative Two-Person Games; Mixed-Integer Nonlinear Optimization</value>
    </subject>
    <collection role="msc" number="91-XX">GAME THEORY, ECONOMICS, SOCIAL AND BEHAVIORAL SCIENCES</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="projects" number="CRC1026">CRC1026</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1816/ZR-13-25.pdf</file>
  </doc>
  <doc>
    <id>1653</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2012-11-19</completedDate>
    <publishedDate>2012-11-19</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Validation of Nominations in Gas Network Optimization: Models, Methods, and Solutions</title>
    <abstract language="eng">In this article we investigate methods to solve a fundamental task in gas transportation, namely the validation of nomination problem: Given a gas transmission network consisting of passive pipelines and active, controllable elements and given an amount of gas at every entry and exit point of the network, find operational settings for all active elements such that there exists a network state meeting all physical, technical, and legal constraints.&#13;
We describe a two-stage approach to solve the resulting complex and numerically difficult mixed-integer non-convex nonlinear feasibility problem. The first phase consists of four distinct algorithms facilitating mixed-integer linear, mixed-integer nonlinear, reduced nonlinear, and complementarity constrained methods to compute possible settings for the discrete decisions. The second phase employs a precise continuous nonlinear programming model of the gas network. Using this setup, we are able to compute high quality solutions to real-world industrial instances whose size is significantly larger than networks that have appeared  in the literature previously.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-16531</identifier>
    <identifier type="doi">10.1080/10556788.2014.888426</identifier>
    <enrichment key="SourceTitle">Appeared in: Optimization Methods and Software 30 (2015) pp. 15-53</enrichment>
    <author>Marc Pfetsch</author>
    <submitter>Jonas Schweiger</submitter>
    <author>Armin Fügenschuh</author>
    <author>Björn Geißler</author>
    <author>Nina Geißler</author>
    <author>Ralf Gollmer</author>
    <author>Benjamin Hiller</author>
    <author>Jesco Humpola</author>
    <author>Thorsten Koch</author>
    <author>Thomas Lehmann</author>
    <author>Alexander Martin</author>
    <author>Antonio Morsi</author>
    <author>Jessica Rövekamp</author>
    <author>Lars Schewe</author>
    <author>Martin Schmidt</author>
    <author>Rüdiger Schultz</author>
    <author>Robert Schwarz</author>
    <author>Jonas Schweiger</author>
    <author>Claudia Stangl</author>
    <author>Marc Steinbach</author>
    <author>Stefan Vigerske</author>
    <author>Bernhard Willert</author>
    <series>
      <title>ZIB-Report</title>
      <number>12-41</number>
    </series>
    <collection role="ccs" number="D.">Software</collection>
    <collection role="ccs" number="J.">Computer Applications</collection>
    <collection role="msc" number="90-08">Computational methods</collection>
    <collection role="msc" number="90C11">Mixed integer programming</collection>
    <collection role="msc" number="90C30">Nonlinear programming</collection>
    <collection role="msc" number="90C90">Applications of mathematical programming</collection>
    <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="persons" number="vigerske">Vigerske, Stefan</collection>
    <collection role="projects" number="MODAL-GasLab">MODAL-GasLab</collection>
    <collection role="projects" number="ForNe">ForNe</collection>
    <collection role="projects" number="MODAL-Gesamt">MODAL-Gesamt</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/1653/ZR-12-41.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/1653/ZR-12-41_revised.pdf</file>
  </doc>
  <doc>
    <id>1686</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2012-11-27</completedDate>
    <publishedDate>2012-11-27</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Mixed-Integer Linear Methods for Layout-Optimization of Screening Systems in Recovered Paper Production</title>
    <abstract language="eng">The industrial treatment of waste paper in order to regain valuable&#13;
fibers from which recovered paper can be produced, involves several&#13;
steps of preparation. One important step is the separation of stickies&#13;
that are normally attached to the paper. If not properly separated,&#13;
remaining stickies reduce the quality of the recovered paper or even&#13;
disrupt the production process. For the mechanical separation process&#13;
of fibers from stickies a separator screen is used. This machine has&#13;
one input feed and two output streams, called the accept and the&#13;
reject. In the accept the fibers are concentrated, whereas the reject&#13;
has a higher concentration of stickies. The machine can be controlled&#13;
by setting its reject rate. But even when the reject rate is set&#13;
properly, after just a single screening step, the accept still has too&#13;
many stickies, or the reject too many fibers. To get a proper&#13;
separation, several separators have to be assembled into a&#13;
network. From a mathematical point of view this problem can be seen as&#13;
a multi-commodity network flow design problem with a nonlinear,&#13;
controllable distribution function at each node. We present a&#13;
nonlinear mixed-integer programming model for the simultaneous&#13;
selection of a subset of separators, the network's topology, and the&#13;
optimal setting of each separator. &#13;
Numerical results are obtained via &#13;
different types of linearization of the nonlinearities and the use of&#13;
mixed-integer linear solvers, and compared with state-of-the-art&#13;
global optimization software.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-16862</identifier>
    <author>Armin Fügenschuh</author>
    <submitter>Armin Fügenschuh</submitter>
    <author>Christine Hayn</author>
    <author>Dennis Michaels</author>
    <series>
      <title>ZIB-Report</title>
      <number>12-44</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Mixed-Integer Linear Programming</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Nonlinear Programming</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Piecewise Linear Approximation</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Topology Optimization</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Network Design</value>
    </subject>
    <collection role="ccs" number="J.">Computer Applications</collection>
    <collection role="msc" number="90-XX">OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1686/ZR-12-44.pdf</file>
  </doc>
  <doc>
    <id>1570</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2012-08-07</completedDate>
    <publishedDate>2012-08-07</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Global Manufacturing: How to Use Mathematical Optimisation Methods to Transform to Sustainable Value Creation</title>
    <abstract language="eng">It is clear that a transformation to sustainable value creation is needed, because business as usual is not an option for preserving competitive advantages of leading industries. What does that mean? This contribution proposes possible approaches for a shift in existing manufacturing paradigms. In a first step, sustainability aspects from the German Sustainability Strategy and from the tools of life cycle sustainability assessment are chosen to match areas of a value creation process. Within these aspects are indicators, which can be measured within a manufacturing process. Once these data are obtained they can be used to set up a mathematical linear pulse model of manufacturing in order to analyse the evolution of the system over time, that is the transition process, by using a system dynamics approach. An increase of technology development by a factor of 2 leads to an increase of manufacturing but also to an increase of climate change. Compensation measures need to be taken. This can be done by e.g. taking money from the GDP (as an indicator of the aspect ``macroeconomic performance''). The value of the arc from that building block towards climate change must then be increased by a factor of 10. The choice of independent and representative indicators or aspects shall be validated and double-checked for their significance with the help of multi-criteria mixed-integer programming optimisation methods.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-15703</identifier>
    <enrichment key="SourceTitle">Appeared in: Proceedings of the 10th Global Conference on Sustainable Manufacturing (GCSM2012), Günther Seliger, S. Engin Kilic (Hrsg.), pp. 538 - 545, 2012  ISBN-978-605-63463-1-6</enrichment>
    <author>Rene Scheumann</author>
    <submitter>Ralf Borndörfer</submitter>
    <author>Armin Fügenschuh</author>
    <author>Sebastian Schenker</author>
    <author>Ingmar Vierhaus</author>
    <author>Ralf Borndörfer</author>
    <author>Matthias Finkbeiner</author>
    <series>
      <title>ZIB-Report</title>
      <number>12-28</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Multi-Criteria Optimisation</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Sustainability Indicator</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>System Dynamics</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Value Creation Process</value>
    </subject>
    <collection role="ccs" number="G.">Mathematics of Computing</collection>
    <collection role="pacs" number="00.00.00">GENERAL</collection>
    <collection role="msc" number="90B30">Production models</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1570/ScheumannFuegenschuhSchenkerVierhausBorndoerferFinkbeiner2012__global_manufacturing.pdf</file>
  </doc>
  <doc>
    <id>1157</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2009-11-23</completedDate>
    <publishedDate>2009-11-23</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">The Coolest Path Problem</title>
    <abstract language="eng">We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial optimization. The other is the heat conduction problem from the field of partial differential equations. Together, they make up a control problem, where some geometrical object traverses a digraph in an optimal way, with constraints on intermediate or the final state. We discuss some properties of the problem and present numerical solution techniques. We demonstrate that the problem can be formulated as a linear mixed-integer program. Numerical solutions can thus be achieved within one hour for instances with up to 70 nodes in the graph.</abstract>
    <identifier type="serial">09-37</identifier>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="opus3-id">1216</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-11571</identifier>
    <enrichment key="SourceTitle">Appeared in: NETWORKS AND HETEROGENEOUS MEDIA, Volume 5, Number 1, March 2010 pp. 143–162. doi:10.3934/nhm.2010.5.143</enrichment>
    <author>Martin Frank</author>
    <submitter>unknown unknown</submitter>
    <author>Armin Fügenschuh</author>
    <author>Michael Herty</author>
    <author>Lars Schewe</author>
    <series>
      <title>ZIB-Report</title>
      <number>09-37</number>
    </series>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="msc" number="35K05">Heat equation</collection>
    <collection role="msc" number="90B10">Network models, deterministic</collection>
    <collection role="msc" number="90C10">Integer programming</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1157/ZR_09_37.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/1157/Data.zip</file>
  </doc>
  <doc>
    <id>5759</id>
    <completedYear/>
    <publishedYear>2015</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>201</pageFirst>
    <pageLast>216</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>Springer Berlin Heidelberg</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Fastest, Average and Quantile Schedule</title>
    <abstract language="eng">We consider problems concerning the scheduling of a set of trains on a single track. For every pair of trains there is a minimum headway, which every train must wait before it enters the track after another train. The speed of each train is also given. Hence for every schedule - a sequence of trains - we may compute the time that is at least needed for all trains to travel along the track in the given order. We give the solution to three problems: the fastest schedule, the average schedule, and the problem of quantile schedules. The last problem is a question about the smallest upper bound on the time of a given fraction of all possible schedules. We show how these problems are related to the travelling salesman problem. We prove NP-completeness of the fastest schedule problem, NP-hardness of quantile of schedules problem, and polynomiality of the average schedule problem. We also describe some algorithms for all three problems. In the solution of the quantile problem we give an algorithm, based on a reverse search method, generating with polynomial delay all Eulerian multigraphs with the given degree sequence and a bound on the number of such multigraphs. A better bound is left as an open question.</abstract>
    <parentTitle language="eng">SOFSEM 2015: Theory and Practice of Computer Science</parentTitle>
    <identifier type="doi">10.1007/978-3-662-46078-8_17</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-53592</enrichment>
    <submitter>Torsten Klug</submitter>
    <author>Torsten Klug</author>
    <author>Konstanty Junosza-Szaniawski</author>
    <author>Slawomir Kwasiborski</author>
    <author>Armin Fügenschuh</author>
    <author>Thomas Schlechte</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>scheduling</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>eulerian multigraphs</value>
    </subject>
    <collection role="ccs" number="">Permutations and combinations</collection>
    <collection role="msc" number="05Axx">Enumerative combinatorics For enumeration in graph theory, see 05C30</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="institutes" number="traffic">Mathematics of Transportation and Logistics</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="persons" number="klug">Klug, Torsten</collection>
    <collection role="persons" number="schlechte">Schlechte, Thomas</collection>
    <collection role="projects" number="KOSMOS">KOSMOS</collection>
    <collection role="projects" number="MODAL-RailLab">MODAL-RailLab</collection>
    <collection role="projects" number="MODAL-Gesamt">MODAL-Gesamt</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>6274</id>
    <completedYear/>
    <publishedYear>2015</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">Global and Local Optimal Control of a Resource Utilization Problem</title>
    <abstract language="eng">System Dynamic models describe physical, technical, economical, or social systems using differential and algebraic equations. In their purest form, these models are intended to describe the evolution of a system from a given initial state. In many applications, it is possible to intervene with the system in order to obtain a desired dynamic or a certain outcome in the end. On the mathematical side, this leads to control problems, where aside from the simulation one has to find optimal intervention functions over time that maximize a specific objective function. Using a dynamical model for the utilization of a natural nonrenewable resource of Behrens as a demonstrator example, we present two main mathematical solution strategies.  They are distinguished by the quality certificate on their respective solution: one leads to proven local optimal solution, and the other technique yields proven global optimal solutions. We present implementational and numerical issues, and a comparison of both methods.</abstract>
    <parentTitle language="eng">Proceedings of the&#13;
33rd International Conference of the System Dynamics Society</parentTitle>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="FulltextUrl">http://www.systemdynamics.org/conferences/2015/proceed/papers/P1376.pdf</enrichment>
    <author>Ingmar Vierhaus</author>
    <submitter>Ingmar Vierhaus</submitter>
    <author>Armin Fügenschuh</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="projects" number="CRC1026">CRC1026</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>4940</id>
    <completedYear/>
    <publishedYear>2011</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>habilitation</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>2011-02-18</thesisDateAccepted>
    <title language="eng">Computational aspects of time in scheduling and dynamic flow problems</title>
    <advisor>Martin Grötschel</advisor>
    <author>Armin Fügenschuh</author>
    <submitter> Engel</submitter>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <thesisGrantor>Technische Universität Berlin</thesisGrantor>
  </doc>
  <doc>
    <id>6188</id>
    <completedYear/>
    <publishedYear>2017</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>239</pageFirst>
    <pageLast>253</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>bookpart</type>
    <publisherName>Springer International Publishing</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Optimisation Methods in Sustainable Manufacturing</title>
    <abstract language="eng">Sustainable manufacturing is driven by the insight that the focus on the economic dimension in current businesses and lifestyles has to be broadened to cover all three pillars of sustainability: economic development, social development, and environmental protection.</abstract>
    <parentTitle language="eng">Sustainable Manufacturing</parentTitle>
    <subTitle language="eng">Challenges, Solutions and Implementation Perspectives</subTitle>
    <identifier type="isbn">978-3-319-48514-0</identifier>
    <identifier type="doi">10.1007/978-3-319-48514-0_15</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Sebastian Schenker</author>
    <submitter>Sebastian Schenker</submitter>
    <editor>Rainer Stark</editor>
    <author>Ingmar Vierhaus</author>
    <editor>Günther Seliger</editor>
    <author>Ralf Borndörfer</author>
    <editor>Jérémy Bonvoisin</editor>
    <author>Armin Fügenschuh</author>
    <author>Martin Skutella</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="projects" number="MODAL-RailLab">MODAL-RailLab</collection>
    <collection role="projects" number="MODAL-SynLab">MODAL-SynLab</collection>
    <collection role="projects" number="CRC1026">CRC1026</collection>
    <collection role="projects" number="MODAL-Gesamt">MODAL-Gesamt</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>5302</id>
    <completedYear/>
    <publishedYear>2013</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">A Global Approach to the Optimal Control of System Dynamics Models</title>
    <abstract language="eng">The System Dynamics (SD) methodology is a framework for modeling and simulating the dynamic behavior of socioeconomic systems. Characteristic for the description of such systems is the occurrence of feedback loops together with stocks and flows. The mathematical equations that describe the system are usually ordinary differential equations and nonlinear algebraic constraints. Seemingly simple systems can show a nonintuitive, unpredictable behavior over time. Controlling a dynamical system means to specify potential interventions from outside that should keep the system on the desired track, and to define an evaluation schema to compare different controls among each other, so that a ``best'' control can be defined in a meaningful way. The central question is how to compute such globally optimal control for a given SD model, that allows the transition of the system into a desired state with minimum effort. We propose a mixed-integer nonlinear programming (MINLP) reformulation of the System Dynamics Optimization (SDO) problem. MINLP problems can be solved by linear programming based branch-and-bound approach. We demonstrate that standard MINLP solvers are not able to solve SDO problem. To overcome this obstacle, we introduce a special-tailored bound propagation method. Numerical results for these test cases are presented.</abstract>
    <parentTitle language="eng">Proceedings of the 31st International Conference of the System Dynamics Society</parentTitle>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-18600</enrichment>
    <author>Ingmar Vierhaus</author>
    <submitter>Ingmar Vierhaus</submitter>
    <author>Armin Fügenschuh</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="projects" number="CRC1026">CRC1026</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>5303</id>
    <completedYear/>
    <publishedYear>2014</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">Modern Nonlinear Optimization Techniques for an Optimal Control of System Dynamics Models</title>
    <abstract language="eng">We study System Dynamics models with several free parameters that can be altered by the user. We assume that the user's goal is to achieve a certain dynamic behavior of the model by varying these parameters. In order to find best possible combination of parameter settings, several automatic parameter tuning methods are described in the literature and readily available within existing System Dynamic software packages. We give a survey on the available techniques in the market and describe their theoretical background. Some of these methods are already six decades old, and meanwhile newer and more powerful optimization methods have emerged in the mathematical literature. One major obstacle for their direct use are tabled data in System Dynamics models, which are usually interpreted as piecewise linear functions. However, modern optimization methods usually require smooth functions which are twice continuously differentiable. We overcome this problem by a smooth spline interpolation of the tabled data. We use a test set of three complex System Dynamic models from the literature, describe their individual transition into optimization problems, and demonstrate the applicability of modern optimization algorithms to these System Dynamics Optimization problems.</abstract>
    <parentTitle language="eng">Proceedings of the 32nd International Conference of the System Dynamics Society</parentTitle>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-48159</enrichment>
    <author>Ingmar Vierhaus</author>
    <submitter>Ingmar Vierhaus</submitter>
    <author>Armin Fügenschuh</author>
    <author>Robert Lion Gottwald</author>
    <author>Stefan Grösser</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="fuegenschuh">Fügenschuh, Armin</collection>
    <collection role="persons" number="robert.gottwald">Gottwald, Robert</collection>
    <collection role="projects" number="CRC1026">CRC1026</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
</export-example>
