<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>785</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2004-04-20</completedDate>
    <publishedDate>2004-04-20</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Models for Line Planning in Public Transport</title>
    <abstract language="eng">The \emph{line planning problem} is one of the fundamental problems in strategic planning of public and rail transport. It consists of finding lines and corresponding frequencies in a public transport network such that a given travel demand can be satisfied. There are (at least) two objectives. The transport company wishes to minimize its operating cost; the passengers request short travel times. We propose two new multi-commodity flow models for line planning. Their main features, in comparison to existing models, are that the passenger paths can be freely routed and that the lines are generated dynamically.</abstract>
    <identifier type="serial">04-10</identifier>
    <identifier type="opus3-id">786</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-7854</identifier>
    <identifier type="doi">10.1007/978-3-540-73312-6_18</identifier>
    <enrichment key="SourceTitle">Appeared in: Computer-aided Systems in Public Transport. Mark Hickman, Pitu Mirchandani, Stefan Voss (eds.) Lecture Notes in Economics and Mathematical Systems, 600, 2008, pp. 363-378</enrichment>
    <author>Ralf Borndörfer</author>
    <author>Martin Grötschel</author>
    <author>Marc Pfetsch</author>
    <series>
      <title>ZIB-Report</title>
      <number>04-10</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>line planning</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>column generation</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="msc" number="90B06">Transportation, logistics</collection>
    <collection role="msc" number="90C27">Combinatorial 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="groetschel">Grötschel, Martin</collection>
    <collection role="projects" number="MATHEON-B1">MATHEON-B1</collection>
    <collection role="projects" number="MATHEON-B15">MATHEON-B15</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/785/ZR-04-10.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/785/ZR-04-10.pdf</file>
  </doc>
  <doc>
    <id>1186</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation>Zuse Institut Berlin</creatingCorporation>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2010-08-24</completedDate>
    <publishedDate>2010-08-24</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Railway Track Allocation by Rapid Branching</title>
    <abstract language="eng">The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway network. Although it can be modeled as a standard path packing problem, instances of sizes relevant for real-world railway applications could not be solved up to now. We propose a rapid branching column generation approach that integrates the solution of the LP relaxation of a path coupling formulation of the problem with a special rounding heuristic. The approach is based on and exploits special properties of the bundle method for the approximate solution of convex piecewise linear functions. Computational results for difficult instances of the benchmark library TTPLIB are reported.</abstract>
    <identifier type="serial">10-22</identifier>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="opus3-id">1247</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-11864</identifier>
    <author>Ralf Borndörfer</author>
    <submitter>unknown unknown</submitter>
    <author>Thomas Schlechte</author>
    <author>Steffen Weider</author>
    <series>
      <title>ZIB-Report</title>
      <number>10-22</number>
    </series>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Trassenallokationsproblem</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Ganzzahlige Programmierung</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Rapid-Branching-Heuristik</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Proximale Bündelmethode</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Optimization</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Railway Track Allocation</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Bundle Method</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Rapid Branching</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="msc" number="90B06">Transportation, logistics</collection>
    <collection role="msc" number="90C27">Combinatorial optimization</collection>
    <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="schlechte">Schlechte, Thomas</collection>
    <collection role="persons" number="weider">Weider, Steffen</collection>
    <collection role="projects" number="MATHEON-B22">MATHEON-B22</collection>
    <collection role="projects" number="Trassenbörse">Trassenbörse</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1186/ZR_10_22.pdf</file>
  </doc>
  <doc>
    <id>4421</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>2014-02-18</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Metric Inequalities for Routings on Direct Connections</title>
    <abstract language="eng">We consider multi-commodity flow problems in which capacities are installed on paths. In this setting, it is often important to distinguish between flows on direct connection routes, using single paths, and flows that include path switching.  We show that the concept of metric inequalities to characterize capacities that&#13;
support a multi-commodity flow can be generalized to deal with direct connections.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-44219</identifier>
    <author>Ralf Borndörfer</author>
    <submitter>Marika Karbstein</submitter>
    <author>Marika Karbstein</author>
    <series>
      <title>ZIB-Report</title>
      <number>14-04</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>metric inequalities</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>direct connection</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>multi-commodity flow problem</value>
    </subject>
    <collection role="msc" number="90C10">Integer programming</collection>
    <collection role="msc" number="90C27">Combinatorial optimization</collection>
    <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="projects" number="MATHEON-B15">MATHEON-B15</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/4421/ZR14_04.pdf</file>
  </doc>
  <doc>
    <id>495</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>deu</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>1993-03-11</completedDate>
    <publishedDate>1993-03-11</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="deu">Telebus-Disposition: Ein Konzept zur Serviceverbesserung bei gleichzeitiger Kostensenkung.[nur hausintern]</title>
    <abstract language="deu">"`Telebus"' ist der soziale Behindertenfahrdienst im Land Berlin. Das Telebus-Forschungsprojekt des Konrad-Zuse-Zentrums für Informationstechnik (ZIB) hat das Ziel, den Fahrdienst (insbesondere die Disposition der Telebusse) zu verbessern, d.h. kundenfreundlicher zu gestalten und gleichzeitig billiger zu machen. In diesem Bericht werden die bisherigen Ergebnisse dargestellt und weitere Möglichkeiten zur Verbesserung des Service und zur Reduzierung der Kosten skizziert. \originalTeX</abstract>
    <identifier type="serial">TR-93-03</identifier>
    <identifier type="opus3-id">495</identifier>
    <note>Volltext nur Hausintern</note>
    <author>Ralf Borndörfer</author>
    <author>Martin Grötschel</author>
    <author>Fridolin Klostermeier</author>
    <author>Christian Küttner</author>
    <series>
      <title>ZIB-Report</title>
      <number>TR-93-03</number>
    </series>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <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="groetschel">Grötschel, Martin</collection>
    <collection role="projects" number="SenWiFo-Telebus">SenWiFo-Telebus</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>4190</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-01-08</completedDate>
    <publishedDate>2013-01-08</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Configuration Model for the Line Planning Problem</title>
    <abstract language="eng">We propose a novel extended formulation for the line planning problem in public transport. It is based on a new concept of frequency configurations that account for all possible options to provide a required transportation capacity on an infrastructure edge.  We show that this model yields a strong LP relaxation. It implies, in particular, general classes of facet defining inequalities for the standard model.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-41903</identifier>
    <identifier type="doi">10.4230/OASIcs.ATMOS.2013.68</identifier>
    <author>Ralf Borndörfer</author>
    <submitter>Marika Karbstein</submitter>
    <author>Heide Hoppmann</author>
    <author>Marika Karbstein</author>
    <series>
      <title>ZIB-Report</title>
      <number>13-40</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>combinatorial optimization</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>polyhedral combinatorics</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>line planning</value>
    </subject>
    <collection role="msc" number="90B06">Transportation, logistics</collection>
    <collection role="msc" number="90C10">Integer programming</collection>
    <collection role="msc" number="90C27">Combinatorial optimization</collection>
    <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="hoppmann">Hoppmann, Heide</collection>
    <collection role="projects" number="ECMath-MI3">ECMath-MI3</collection>
    <collection role="projects" number="MATHEON-B15">MATHEON-B15</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/4190/ZR-13-40.pdf</file>
  </doc>
  <doc>
    <id>5849</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>2016-03-24</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Robust Allocation of Operating Rooms with Lognormal case Durations</title>
    <abstract language="eng">The problem of allocating operating rooms (OR) to surgical cases is a challenging task,&#13;
involving both combinatorial aspects and uncertainty handling. In this article,&#13;
we formulate this problem as a job shop scheduling problem, in which the job durations follow a lognormal distribution.&#13;
We propose to use a cutting-plane approach to solve a robust version of this optimization problem. To this end, &#13;
we develop an algorithm based on fixed-point iterations to solve the subproblems that&#13;
identify worst-case scenarios and generate cut inequalities. The procedure is illustrated with numerical experiments based&#13;
on real data from a major hospital in Berlin.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-58497</identifier>
    <identifier type="url">http://www.pms2016.com/congreso/ficha.en.html</identifier>
    <enrichment key="SourceTitle">Proceedings of the 15th International Conference on Project Management and Scheduling (PMS 2016), pp.52-55</enrichment>
    <author>Guillaume Sagnol</author>
    <submitter>Guillaume Sagnol</submitter>
    <author>Ralf Borndörfer</author>
    <author>Mickaël Grima</author>
    <author>Matthes Seeling</author>
    <author>Claudia Spies</author>
    <series>
      <title>ZIB-Report</title>
      <number>16-16</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>robust optimization</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>lognormal duration</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Hilbert's projective metric</value>
    </subject>
    <collection role="msc" number="90Cxx">Mathematical programming [See also 49Mxx, 65Kxx]</collection>
    <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="sagnol">Sagnol, Guillaume</collection>
    <collection role="projects" number="Charité-OPOSSUM">Charité-OPOSSUM</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <thesisPublisher>Zuse Institute Berlin (ZIB)</thesisPublisher>
    <thesisGrantor>Freie Universität Berlin</thesisGrantor>
    <file>https://opus4.kobv.de/opus4-zib/files/5849/PMS2016_zib.pdf</file>
  </doc>
  <doc>
    <id>420</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>deu</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>1999-09-17</completedDate>
    <publishedDate>1999-09-17</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="deu">Der Schnellste Weg zum Ziel</title>
    <abstract language="deu">Wir geben eine Einführung in die Mathematik von und mit Wegen. Nicht auf dem kürzesten, aber auf einem hoffentlich kurzweiligen Weg!</abstract>
    <identifier type="serial">SC-99-32</identifier>
    <identifier type="opus3-id">421</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-4209</identifier>
    <identifier type="doi">10.1007/978-3-322-96366-6_5</identifier>
    <enrichment key="SourceTitle">Appeared in: Aigner u. Behrends (Eds.) (2000), Alles Mathematik, Vieweg Verlag. S. 45-76</enrichment>
    <author>Ralf Borndörfer</author>
    <author>Martin Grötschel</author>
    <author>Andreas Löbel</author>
    <series>
      <title>ZIB-Report</title>
      <number>SC-99-32</number>
    </series>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Kürzeste Wege</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Kombinatorische Optimierung</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Operations Research</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="msc" number="90C10">Integer programming</collection>
    <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="groetschel">Grötschel, Martin</collection>
    <collection role="persons" number="loebel">Löbel, Andreas</collection>
    <collection role="projects" number="BMBF-DS">BMBF-DS</collection>
    <collection role="projects" number="MATHEON-B1">MATHEON-B1</collection>
    <collection role="projects" number="SenWiFo-Telebus">SenWiFo-Telebus</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/420/SC-99-32.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/420/SC-99-32.pdf</file>
  </doc>
  <doc>
    <id>6075</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>2016-01-11</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">The Graph Segmentation Problem</title>
    <abstract language="eng">We investigate a graph theoretical problem arising in the automatic billing of a network toll. Given a network and a family of user paths, we study the graph segmentation problem (GSP) to cover parts of the user paths by a set of disjoint segments. The GSP is shown to be NP-hard but for special cases it can be solved in polynomial time. We also show that the marginal utility of a segment is bounded. Computational results for real-world instances show that in practice the problem is more amenable than the theoretic bounds suggest.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-60750</identifier>
    <enrichment key="SourceTitle">INOC 2017 – 8th International Network Optimization Conference</enrichment>
    <author>Stephan Schwartz</author>
    <submitter>Stephan Schwartz</submitter>
    <author>Ralf Borndörfer</author>
    <author>Gerald Bartz</author>
    <series>
      <title>ZIB-Report</title>
      <number>16-53</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>toll billing</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>graph segmentation</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>combinatorial optimization</value>
    </subject>
    <collection role="msc" number="90-XX">OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING</collection>
    <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="schwartz">Schwartz, Stephan</collection>
    <collection role="projects" number="no-project">no-project</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/6075/ZR-16-53.pdf</file>
  </doc>
  <doc>
    <id>5929</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>2016-04-26</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Makespan and Tardiness in Activity Networks with Lognormal Activity Durations</title>
    <abstract language="eng">We propose an algorithm to approximate the distribution of the completion time (makespan)&#13;
and the tardiness costs of a project, when durations are lognormally distributed. This problem arises naturally for the optimization of surgery scheduling,&#13;
where it is very common to assume lognormal procedure times. We present an analogous of Clark's formulas to compute the moments of the maximum of a set of&#13;
lognormal variables. Then, we use moment matching formulas to approximate the earliest starting time of each activity of the project by a shifted lognormal variable.&#13;
This approach can be seen as a lognormal variant of a state-of-the-art method used for the statistical static timing analysis (SSTA) of digital circuits.&#13;
We carried out numerical experiments with instances based on real data from the application to surgery scheduling. We obtained very&#13;
promising results, especially for the approximation of the mean overtime in operating rooms, &#13;
for which our algorithm yields results of a similar quality to Monte-Carlo simulations&#13;
requiring an amount of computing time several orders of magnitude larger.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-59290</identifier>
    <author>Guillaume Sagnol</author>
    <submitter>Guillaume Sagnol</submitter>
    <author>Felix Balzer</author>
    <author>Ralf Borndörfer</author>
    <author>Claudia Spies</author>
    <author>Falk von Dincklage</author>
    <series>
      <title>ZIB-Report</title>
      <number>16-23</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>scheduling</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>activity network</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>lognormal distribution</value>
    </subject>
    <collection role="msc" number="68M20">Performance evaluation; queueing; scheduling [See also 60K25, 90Bxx]</collection>
    <collection role="msc" number="90B36">Scheduling theory, stochastic [See also 68M20]</collection>
    <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="sagnol">Sagnol, Guillaume</collection>
    <collection role="projects" number="Charité-OPOSSUM">Charité-OPOSSUM</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/5929/lognorm_sched_zib_v1.pdf</file>
  </doc>
  <doc>
    <id>5960</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>2016-06-03</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Using sparse kernels to design computer experiments with tunable precision</title>
    <abstract language="eng">Statistical methods to design computer experiments usually rely on a Gaussian process (GP) surrogate model, and typically aim at selecting design points (combinations of algorithmic and model parameters) that minimize the average prediction variance, or maximize the prediction accuracy for the hyperparameters of the GP surrogate.&#13;
In many applications, experiments have a tunable precision, in the sense that one software parameter controls the tradeoff between accuracy and computing time (e.g., mesh size in FEM simulations or number of Monte-Carlo samples).&#13;
We formulate the problem of allocating a budget of computing time over a finite set of candidate points for the goals mentioned above. This is a continuous optimization problem, which is moreover convex whenever the tradeoff function accuracy vs. computing time is concave.&#13;
On the other hand, using non-concave weight functions can help to identify sparse designs. In addition, using sparse kernel approximations drastically reduce the cost per iteration of the multiplicative weights updates that can be used to solve this problem.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-59605</identifier>
    <enrichment key="SourceTitle">Appeared in: Ana Colubi, Angela Blanco and Cristian Gatu (eds.) 22nd Intern. Conf. on Computational Statistics - COMSTAT 2016, Oviedo, Spain, 23-26 August 2016, Proceedings ISBN 978-90-73592-36-0. Pp. 397-408</enrichment>
    <author>Guillaume Sagnol</author>
    <submitter>Guillaume Sagnol</submitter>
    <author>Hans-Christian Hege</author>
    <author>Martin Weiser</author>
    <series>
      <title>ZIB-Report</title>
      <number>16-33</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Optimal design of computer experiments</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Sparse kernels</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Gaussian Process</value>
    </subject>
    <collection role="msc" number="62K05">Optimal designs</collection>
    <collection role="institutes" number="num">Numerical Mathematics</collection>
    <collection role="institutes" number="vis">Visual Data Analysis</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="institutes" number="compmed">Computational Medicine</collection>
    <collection role="institutes" number="visalgo">Visual Data Analysis in Science and Engineering</collection>
    <collection role="institutes" number="traffic">Mathematics of Transportation and Logistics</collection>
    <collection role="persons" number="hege">Hege, Hans-Christian</collection>
    <collection role="persons" number="sagnol">Sagnol, Guillaume</collection>
    <collection role="persons" number="weiser">Weiser, Martin</collection>
    <collection role="projects" number="ZIB-HPC-DoE">ZIB-HPC-DoE</collection>
    <collection role="institutes" number="VDcC">Visual and Data-centric Computing</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/5960/optdes_kriging_compstat_v2_zib.pdf</file>
  </doc>
  <doc>
    <id>5907</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>2016-06-04</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Perfect f-Matchings and f-Factors in Hypergraphs - A Combinatorial Approach</title>
    <abstract language="eng">We prove characterizations of the existence of perfect f-matchings in uniform mengerian and perfect hypergraphs. Moreover, we investigate the f-factor problem in balanced hypergraphs. For uniform balanced hypergraphs we prove two existence theorems with purely combinatorial arguments, whereas for non-uniform balanced hypergraphs we show that the f-factor problem is NP-hard.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-59071</identifier>
    <identifier type="doi">10.1016/j.disc.2017.05.005</identifier>
    <enrichment key="SourceTitle">Appeared in: Discrete Mathematics Volume 340, Issue 10, October 2017, Pages 2499-2506</enrichment>
    <author>Isabel Beckenbach</author>
    <submitter>Isabel Beckenbach</submitter>
    <author>Robert Scheidweiler</author>
    <series>
      <title>ZIB-Report</title>
      <number>16-22</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>perfect f-matchings in hypergraphs</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>f-factors in hypergraphs</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>mengerian hypergraph</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>balanced hypergraph</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>perfect hypergraph</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Hall's Theorem</value>
    </subject>
    <collection role="msc" number="05C65">Hypergraphs</collection>
    <collection role="msc" number="05C70">Factorization, matching, partitioning, covering and packing</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="institutes" number="traffic">Mathematics of Transportation and Logistics</collection>
    <collection role="persons" number="beckenbach">Beckenbach, Isabel</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/5907/perfectfmatchingspreprint.pdf</file>
  </doc>
  <doc>
    <id>6128</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>2016-01-12</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A novel partitioning of the set of non-dominated points</title>
    <abstract language="eng">We consider a novel partitioning of the set of non-dominated points for general multi-objective integer programs with $k$ objectives. The set of non-dominated points is partitioned into a set of non-dominated points whose efficient solutions are also efficient for some restricted subproblem with one less objective; the second partition comprises the non-dominated points whose efficient solutions are&#13;
inefficient for any of the restricted subproblems. We show that the first partition has the nice property that it yields finite rectangular boxes in which the points of the second partition are&#13;
located.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-61286</identifier>
    <author>Sebastian Schenker</author>
    <submitter>Sebastian Schenker</submitter>
    <author>Ralf Borndörfer</author>
    <author>Martin Skutella</author>
    <series>
      <title>ZIB-Report</title>
      <number>16-55</number>
    </series>
    <collection role="ccs" number="G.2">DISCRETE MATHEMATICS</collection>
    <collection role="msc" number="90C10">Integer programming</collection>
    <collection role="msc" number="90C29">Multi-objective and goal programming</collection>
    <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="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>
    <file>https://opus4.kobv.de/opus4-zib/files/6128/report_16-55.pdf</file>
  </doc>
  <doc>
    <id>5462</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-04-22</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A robust minimax Semidefinite Programming formulation for optimal design of experiments for model parametrization</title>
    <abstract language="eng">Model-based optimal design of experiments (M-bODE) is a crucial step in model parametrization since it encloses a framework&#13;
that maximizes the amount of information extracted from a battery of lab experiments.&#13;
We address the design of M-bODE for dynamic models considering a continuous representation of the design.&#13;
We use Semidefinite Programming (SDP) to derive robust minmax formulations for nonlinear models,&#13;
and extend the formulations to other criteria. The approaches are demonstrated for a CSTR where a two-step reaction occurs.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-54626</identifier>
    <identifier type="doi">10.1016/B978-0-444-63578-5.50146-8</identifier>
    <enrichment key="SourceTitle">Appeared in: Computer Aided Chemical Engineering  Volume 37, 2015, Pages 905–910  12th International Symposium on Process Systems Engineering and 25th European Symposium on Computer Aided Process Engineering</enrichment>
    <author>Belmiro P.M. Duarte</author>
    <submitter>Guillaume Sagnol</submitter>
    <author>Guillaume Sagnol</author>
    <author>Nuno M.C. Oliveira</author>
    <series>
      <title>ZIB-Report</title>
      <number>15-03</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Optimal design of experiments</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Semidefinite Programming</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Robust minmax designs</value>
    </subject>
    <collection role="msc" number="62K25">Robust parameter designs</collection>
    <collection role="msc" number="90C22">Semidefinite programming</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="institutes" number="traffic">Mathematics of Transportation and Logistics</collection>
    <collection role="persons" number="sagnol">Sagnol, Guillaume</collection>
    <collection role="projects" number="ZIB-OptDes">ZIB-OptDes</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/5462/robust_sdp_zibreport.pdf</file>
  </doc>
  <doc>
    <id>1070</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2008-03-25</completedDate>
    <publishedDate>2008-03-25</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Models for Fare Planning in Public Transport</title>
    <abstract language="eng">The optimization of fare systems in public transit allows to pursue objectives such as the maximization of demand, revenue, profit, or social welfare. We propose a non-linear optimization approach to fare planning that is based on a detailed discrete choice model of user behavior. The approach allows to analyze different fare structures, optimization objectives, and operational scenarios involving, e.g., subsidies. We use the resulting models to compute optimized fare systems for the city of Potsdam, Germany.</abstract>
    <identifier type="serial">08-16</identifier>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="opus3-id">1099</identifier>
    <identifier type="doi">10.1016/j.dam.2012.02.027</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-10708</identifier>
    <enrichment key="SourceTitle">A rev. vers. appeared in: Discrete Applied Mathematics Volume 160, Issue 18, December 2012, Pages 2591–2605</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>unknown unknown</submitter>
    <author>Marika Neumann</author>
    <author>Marc Pfetsch</author>
    <series>
      <title>ZIB-Report</title>
      <number>08-16</number>
    </series>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Preisplanung</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Nachfragefunktion</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Optimierung</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Nahverkehr</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="msc" number="90B20">Traffic problems</collection>
    <collection role="msc" number="91B74">Models of real-world systems</collection>
    <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="projects" number="MATHEON-B15">MATHEON-B15</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1070/ZR_08_16.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/1070/ZR_08_16_revised.pdf</file>
  </doc>
  <doc>
    <id>1055</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>deu</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2008-01-15</completedDate>
    <publishedDate>2008-01-15</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="deu">Angebotsplanung im öffentlichen Nahverkehr</title>
    <title language="eng">Service Design in Public Transport</title>
    <abstract language="deu">Die Angebotsplanung im öffentlichen Nahverkehr umfasst die Aufgaben der Netz-, Linien-,Fahr- und Preisplanung. Wir stellen zwei mathematische Optimierungsmodelle zur Linien- und Preisplanung vor. Wir zeigen anhand von Berechnungen für die Verkehrsbetriebe in Potsdam(ViP), dass sich damit komplexe Zusammenhänge quantitativ analysieren lassen. Auf diese Weise untersuchen wir die Auswirkungen von Freiheitsgraden auf die Konstruktion von Linien und die Wahl von Reisewegen der Passagiere, Abhängigkeiten zwischen Kosten und Reisezeiten sowie den Einfluss verschiedener Preissysteme auf Nachfrage und Kostendeckung.</abstract>
    <identifier type="serial">08-04</identifier>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="opus3-id">1084</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-10555</identifier>
    <enrichment key="SourceTitle">To appear in Heureka '08</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>unknown unknown</submitter>
    <author>Marika Neumann</author>
    <author>Marc Pfetsch</author>
    <series>
      <title>ZIB-Report</title>
      <number>08-04</number>
    </series>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Preisplanung</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Linienplanung</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Optimierung</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="msc" number="90B06">Transportation, logistics</collection>
    <collection role="msc" number="90B20">Traffic problems</collection>
    <collection role="msc" number="90C27">Combinatorial optimization</collection>
    <collection role="msc" number="91B74">Models of real-world systems</collection>
    <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="projects" number="MATHEON-B15">MATHEON-B15</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1055/ZR_08_04.pdf</file>
  </doc>
  <doc>
    <id>854</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2005-03-23</completedDate>
    <publishedDate>2005-03-23</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Fare Planning for Public Transport</title>
    <abstract language="eng">In this paper we introduce the fare planning problem for public transport which consists in designing a system of fares maximizing revenue. We propose a new simple general model for this problem. It i s based on a demand function and constraints for the different fares. The constraints define the structure of the fare system, e.g., distance dependent fares or zone fares. We discuss a simple example with a quadratic demand function and distance dependent fares. Then we introduce a more realistic discrete choice model in which passengers choose between different alternatives depending on the numb er of trips per month. We demonstrate the examples by computational experiments.</abstract>
    <identifier type="serial">05-20</identifier>
    <identifier type="opus3-id">854</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-8541</identifier>
    <author>Ralf Borndörfer</author>
    <author>Marika Neumann</author>
    <author>Marc Pfetsch</author>
    <series>
      <title>ZIB-Report</title>
      <number>05-20</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>fare planning</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>demand function</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>discrete choice model</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="msc" number="90B20">Traffic problems</collection>
    <collection role="msc" number="91B74">Models of real-world systems</collection>
    <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="projects" number="MATHEON-B1">MATHEON-B1</collection>
    <collection role="projects" number="MATHEON-B15">MATHEON-B15</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/854/ZR-05-20.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/854/ZR-05-20.ps</file>
  </doc>
  <doc>
    <id>6401</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>2017-05-16</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Combinatorial Proof of a König-type Theorem for Unimodular Hypergraphs</title>
    <abstract language="eng">We state purely combinatorial proofs for König- and Hall-type theorems for a wide class of combinatorial optimization problems. Our methods rely on relaxations of the matching and vertex cover problem and, moreover, on the strong coloring properties admitted by bipartite graphs and their generalizations.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-64017</identifier>
    <enrichment key="SubmissionStatus">under review</enrichment>
    <author>Isabel Beckenbach</author>
    <submitter>Isabel Beckenbach</submitter>
    <author>Britta Peis</author>
    <author>Oliver Schaudt</author>
    <author>Robert Scheidweiler</author>
    <series>
      <title>ZIB-Report</title>
      <number>17-27</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Packing</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Covering</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Total Unimodularity</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>König's Theorem</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Factors</value>
    </subject>
    <collection role="msc" number="05C65">Hypergraphs</collection>
    <collection role="msc" number="05C70">Factorization, matching, partitioning, covering and packing</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="institutes" number="traffic">Mathematics of Transportation and Logistics</collection>
    <collection role="persons" number="beckenbach">Beckenbach, Isabel</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/6401/konigTheoremPreprint.pdf</file>
  </doc>
  <doc>
    <id>6393</id>
    <completedYear/>
    <publishedYear>2017</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2017-05-05</completedDate>
    <publishedDate>2017-05-05</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Propagation Approach to Acyclic Rolling Stock Rotation Optimization</title>
    <abstract language="eng">The rolling stock, i.e., railway vehicles, are one of the key ingredients of a running railway system. As it is well known, the offer of a railway company to their customers, i.e., the railway timetable, changes from time to time. Typical reasons for that are different timetables associated with different seasons, maintenance periods or holidays. Therefore, the regular lifetime of a timetable is split into (more or less) irregular periods where parts of the&#13;
 timetable are changed. In order to operate a railway timetable most railway companies set up sequences that define the operation of timetabled trips by a single physical railway vehicle called (rolling stock) rotations. Not surprisingly, the individual parts of a timetable also affect the rotations. More precisely, each of the parts brings up an acyclic rolling stock rotation problem with start and end conditions associated with the beginning and ending of the corresponding period. In this paper, we propose a propagation approach to deal with large planning horizons that are composed of many timetables with shorter individual lifetimes. The approach is based on an integer linear programming formulation that propagates rolling stock rotations through the irregular parts of the timetable while taking a large variety of operational requirements into account. This approach is implemented within the rolling stock rotation optimization framework ROTOR used by DB Fernverkehr AG, one of the leading railway operators in Europe. Computational results for real world scenarios are presented to evaluate the approach.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-63930</identifier>
    <enrichment key="SourceTitle">Appeared in: Proceedings of the IAROR conference RailLille 2017</enrichment>
    <author>Boris Grimm</author>
    <submitter>Boris Grimm</submitter>
    <author>Ralf Borndörfer</author>
    <author>Markus Reuther</author>
    <author>Stanley Schade</author>
    <author>Thomas Schlechte</author>
    <series>
      <title>ZIB-Report</title>
      <number>17-24</number>
    </series>
    <collection role="msc" number="90-XX">OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING</collection>
    <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="grimm">Grimm, Boris</collection>
    <collection role="persons" number="schlechte">Schlechte, Thomas</collection>
    <collection role="projects" number="MODAL-RailLab">MODAL-RailLab</collection>
    <collection role="persons" number="schade">Schade, Stanley</collection>
    <collection role="projects" number="MODAL-Gesamt">MODAL-Gesamt</collection>
    <collection role="persons" number="reuther">Reuther, Markus</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/6393/ZR-17-24.pdf</file>
  </doc>
  <doc>
    <id>1740</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-12-19</completedDate>
    <publishedDate>2012-12-19</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Optimizing Toll Enforcement in Transportation Networks: a Game-Theoretic Approach</title>
    <abstract language="eng">We present a game-theoretic approach to optimize the strategies of toll enforcement&#13;
on a motorway network. In contrast to previous approaches,&#13;
we consider a network with an arbitrary&#13;
topology, and we handle the fact that&#13;
users may choose their Origin-Destination path; in particular they may take a detour to&#13;
avoid sections with a high control rate. We show that a Nash equilibrium can be&#13;
computed with an LP (although the game is not zero-sum), and we give a MIP for the computation&#13;
of a Stackelberg equilibrium. Experimental results based on an application to the&#13;
enforcement of a truck toll on German motorways are presented.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-17401</identifier>
    <identifier type="doi">/10.1016/j.endm.2013.05.100</identifier>
    <enrichment key="SourceTitle">Appeared in: Electronic Notes in Discrete Mathematics  Volume 41, 5 June 2013, Pages 253–260</enrichment>
    <submitter>Guillaume Sagnol</submitter>
    <author>Ralf Borndörfer</author>
    <author>Julia Buwaya</author>
    <author>Guillaume Sagnol</author>
    <author>Elmar Swarat</author>
    <series>
      <title>ZIB-Report</title>
      <number>12-47</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Stackelberg Equilibrium</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Game Theory</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Mixed Integer Programming</value>
    </subject>
    <collection role="ccs" number="I.">Computing Methodologies</collection>
    <collection role="msc" number="91-XX">GAME THEORY, ECONOMICS, SOCIAL AND BEHAVIORAL SCIENCES</collection>
    <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="sagnol">Sagnol, Guillaume</collection>
    <collection role="persons" number="swarat">Swarat, Elmar</collection>
    <collection role="projects" number="TOLLCONTROLOPT">TOLLCONTROLOPT</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1740/zib_report_12_47.pdf</file>
  </doc>
  <doc>
    <id>1429</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-11-21</completedDate>
    <publishedDate>2011-11-21</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">An IP Approach to Toll Enforcement Optimization on German Motorways</title>
    <abstract language="eng">This paper proposes the first model for toll enforcement optimization&#13;
on German motorways. The enforcement is done by mobile control teams and our&#13;
goal is to produce a schedule achieving network-wide control, proportional to&#13;
spatial and time-dependent traffic distributions. Our model consists of two&#13;
parts. The first plans&#13;
control tours using a vehicle routing approach with profits and some side&#13;
constraints. The second plans feasible rosters for the control teams. Both&#13;
problems can be modeled as Multi-Commodity Flow Problems. Adding additional&#13;
coupling constraints produces a large-scale integrated integer programming&#13;
formulation. We show that this model can be solved to optimality for real&#13;
world instances associated with a control area in East Germany.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="serial">11-42</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-14299</identifier>
    <identifier type="doi">10.1007/978-3-642-29210-1_51</identifier>
    <enrichment key="SourceTitle">Appeared in: Operations Research Proceedings 2011, Diethard Klatte et al. (eds.), 2012, pp. 317-322</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Elmar Swarat</submitter>
    <author>Guillaume Sagnol</author>
    <author>Elmar Swarat</author>
    <series>
      <title>ZIB-Report</title>
      <number>11-42</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Toll Enforcement</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Vehicle Routing Problem</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Duty Roster Planning</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Integer Programming</value>
    </subject>
    <collection role="msc" number="90B06">Transportation, logistics</collection>
    <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="sagnol">Sagnol, Guillaume</collection>
    <collection role="persons" number="swarat">Swarat, Elmar</collection>
    <collection role="projects" number="TOLLCONTROLOPT">TOLLCONTROLOPT</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1429/ZR-11-42.pdf</file>
  </doc>
</export-example>
