<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <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>
  <doc>
    <id>5277</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-10-15</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">The Price of Spite in Spot-checking games</title>
    <abstract language="eng">We introduce the class of spot-checking games (SC games). These games model&#13;
problems where the goal is to distribute fare inspectors over a toll network.&#13;
Although SC games are not zero-sum, we show that a Nash equilibrium&#13;
can be computed by linear programming.&#13;
The computation of a strong Stackelberg equilibrium is&#13;
more relevant for this problem, but we show that this is NP-hard.&#13;
However, we give some bounds on the \emph{price of spite},&#13;
which measures how the&#13;
payoff of the inspector&#13;
degrades when committing to a Nash equilibrium. &#13;
Finally, we demonstrate the quality of these bounds for a real-world application,&#13;
namely the enforcement of a truck toll on German motorways.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="doi">10.1007/978-3-662-44803-8</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-52775</identifier>
    <enrichment key="SourceTitle">Appeared in: 7th International Symposium on Algorithmic Game Theory (SAGT'2014), as a brief announcement</enrichment>
    <submitter>Guillaume Sagnol</submitter>
    <author>Guillaume Sagnol</author>
    <author>Ralf Borndörfer</author>
    <author>Thomas Schlechte</author>
    <author>Elmar Swarat</author>
    <series>
      <title>ZIB-Report</title>
      <number>14-38</number>
    </series>
    <collection role="msc" number="05-XX">COMBINATORICS (For finite fields, see 11Txx)</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="schlechte">Schlechte, Thomas</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/5277/sagt-one-page-zib.pdf</file>
  </doc>
  <doc>
    <id>6452</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-07-14</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Structure-based Decomposition for Pattern-Detection for Railway Timetables</title>
    <abstract language="eng">We consider the problem of pattern detection in large scale &#13;
railway timetables. This problem arises in rolling stock optimization planning &#13;
in order to identify invariant sections of the timetable for&#13;
which a cyclic rotation plan is adequate. &#13;
We propose a dual reduction technique which leads to an decomposition &#13;
and enumeration method. Computational results for real &#13;
world instances demonstrate that the method is able to &#13;
produce optimal solutions as fast as standard MIP solvers.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-64525</identifier>
    <enrichment key="SourceTitle">Operations Research 2017</enrichment>
    <author>Stanley Schade</author>
    <submitter>Stanley Schade</submitter>
    <author>Thomas Schlechte</author>
    <author>Jakob Witzig</author>
    <series>
      <title>ZIB-Report</title>
      <number>17-40</number>
    </series>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="institutes" number="mip">Mathematical Optimization Methods</collection>
    <collection role="institutes" number="traffic">Mathematics of Transportation and Logistics</collection>
    <collection role="persons" number="schlechte">Schlechte, Thomas</collection>
    <collection role="projects" number="MIP-ZIBOPT">MIP-ZIBOPT</collection>
    <collection role="projects" number="MODAL-RailLab">MODAL-RailLab</collection>
    <collection role="projects" number="MODAL-SynLab">MODAL-SynLab</collection>
    <collection role="persons" number="schade">Schade, Stanley</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/6452/ZR-17-40.pdf</file>
  </doc>
  <doc>
    <id>6031</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-08-29</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">The Modulo Network Simplex with Integrated Passenger Routing</title>
    <abstract language="eng">Periodic timetabling is an important strategic planning problem in public transport. The task is to determine periodic arrival and departure times of the lines in a given network, minimizing the travel time of the passengers. We extend the modulo network simplex method, a well-established heuristic for the periodic timetabling problem, by integrating a passenger (re)routing step into the pivot operations. Computations on real-world networks show that we can indeed find timetables with much shorter total travel time, when we take the passengers' travel paths into consideration.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-60319</identifier>
    <enrichment key="SourceTitle">To appear in: Operations Research Proceedings 2016</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Heide Hoppmann</submitter>
    <author>Heide Hoppmann</author>
    <author>Marika Karbstein</author>
    <author>Fabian Löbel</author>
    <series>
      <title>ZIB-Report</title>
      <number>16-43</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>periodic timetabling, modulo network simplex, passenger routing</value>
    </subject>
    <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="persons" number="fabian.loebel">Löbel, Fabian</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/6031/ZR-16-43.pdf</file>
  </doc>
  <doc>
    <id>5372</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-02-18</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Recent Success Stories on Optimization of Railway Systems</title>
    <abstract language="eng">Planning and operating railway transportation systems is an extremely&#13;
hard task due to the combinatorial complexity of the underlying discrete&#13;
optimization problems, the technical intricacies, and the immense size of&#13;
the problem instances. Because of that, however, mathematical models&#13;
and optimization techniques can result in large gains for both railway cus-&#13;
tomers and operators, e.g., in terms of cost reductions or service quality&#13;
improvements. In the last years a large and growing group of researchers&#13;
in the OR community have devoted their attention to this domain devel-&#13;
oping mathematical models and optimization approaches to tackle many&#13;
of the relevant problems in the railway planning process. However, there&#13;
is still a gap to bridge between theory and practice, with&#13;
a few notable exceptions. In this paper we address three success stories,&#13;
namely, long-term freight train routing (part I), mid-term rolling stock&#13;
rotation planning (part II), and real-time train dispatching (part III). In&#13;
each case, we describe real-life, successful implementations. We will dis-&#13;
cuss the individual problem setting, survey the optimization literature,&#13;
and focus on particular aspects addressed by the mathematical models.&#13;
We demonstrate on concrete applications how mathematical optimization&#13;
can support railway planning and operations. This gives proof that math-&#13;
ematical optimization can support the planning of rolling stock resources.&#13;
Thus, mathematical models and optimization can lead to a greater effi-&#13;
ciency of railway operations and will serve as a powerful and innovative&#13;
tool to meet recent challenges of the railway industry.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-53726</identifier>
    <enrichment key="SourceTitle">Appeared in: Proceedings of the IAROR conference RailTokyo</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Markus Reuther</submitter>
    <author>Torsten Klug</author>
    <author>Leonardo Lamorgese</author>
    <author>Carlo Mannino</author>
    <author>Markus Reuther</author>
    <author>Thomas Schlechte</author>
    <series>
      <title>ZIB-Report</title>
      <number>14-47</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>railway planning</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>railway operations</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>capacity 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="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="ROTOR">ROTOR</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/5372/ZR-14-47.pdf</file>
  </doc>
  <doc>
    <id>5350</id>
    <completedYear/>
    <publishedYear>2015</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>2015-01-27</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Metric Inequalities for Routings on Direct Connections with Application in Line Planning</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 derive a feasibility condition for path capacities supporting such direct   connection flows similar to the feasibility condition for arc capacities in ordinary multi-commodity flows.&#13;
The concept allows to solve large-scale real-world line planning problems in public transport including a novel passenger routing model that favors direct connections over connections with  transfers.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="doi">10.1016/j.disopt.2015.07.004</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-53507</identifier>
    <enrichment key="SourceTitle">Appeared in: Discrete Optimization 18 (2015) 56-75</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Marika Karbstein</submitter>
    <author>Marika Karbstein</author>
    <series>
      <title>ZIB-Report</title>
      <number>15-07</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>combinatorial optimization</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>integer programming</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>line planning</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>transfers</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>direct connection</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>metric inequalities</value>
    </subject>
    <collection role="msc" number="90B20">Traffic problems</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="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/5350/ZR_15_07.pdf</file>
  </doc>
  <doc>
    <id>5364</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-12-02</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Computing D-optimal experimental designs for estimating treatment contrasts under the presence of a nuisance time trend</title>
    <abstract language="eng">We prove a mathematical programming characterisation of approximate partial D-optimality under general linear constraints. We use this characterisation with a branch-and-bound method to compute a list of all exact D-optimal designs for estimating a pair of treatment contrasts in the presence of a nuisance time trend up to the size of 24 consecutive trials.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="doi">10.1007/978-3-319-13881-7_10</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-53640</identifier>
    <enrichment key="SourceTitle">Appeared in: Stochastic Models, Statistics and Their ApplicationsSpringer Proceedings in Mathematics &amp; Statistics Volume 122, 2015, pp 83-91</enrichment>
    <author>Radoslav Harman</author>
    <submitter>Guillaume Sagnol</submitter>
    <author>Guillaume Sagnol</author>
    <series>
      <title>ZIB-Report</title>
      <number>15-02</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>optimal design of experiments</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>nuisance trend</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>branch and bound</value>
    </subject>
    <collection role="msc" number="62-XX">STATISTICS</collection>
    <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="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/5364/POP-SMSA-ZIB.pdf</file>
  </doc>
  <doc>
    <id>1403</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-09-22</completedDate>
    <publishedDate>2011-09-22</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Railway Track Allocation - Simulation, Aggregation, and Optimization</title>
    <abstract language="eng">Today the railway timetabling process and the track allocation &#13;
is one of the most challenging problems to solve by a railway company.&#13;
Especially due to the deregulation of the transport market in the recent years several&#13;
suppliers of railway traffic have entered the market in Europe. This leads to more &#13;
potential conflicts between trains caused by an increasing demand of train paths.&#13;
&#13;
Planning and operating railway transportation systems is extremely hard due &#13;
to the combinatorial complexity of the underlying discrete optimization problems, &#13;
the technical intricacies, and the immense size of the problem instances.&#13;
In order to make best use of the infrastructure and to ensure economic operation, &#13;
efficient planning of the railway operation is indispensable. &#13;
&#13;
Mathematical optimization models and algorithms can help&#13;
to automatize and tackle these challenges.&#13;
Our contribution in this paper is to present a renewed planning process &#13;
due to the liberalization in Europe and an associated concept for track allocation, that consists &#13;
of three important parts, simulation, aggregation, and optimization. &#13;
Furthermore, we present results of our general framework for real world data.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="serial">11-35</identifier>
    <identifier type="doi">10.1007/978-3-642-27963-8</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-14031</identifier>
    <enrichment key="SourceTitle">Appeared in: Proc. 1st International Workshop on High-speed and Intercity Railways (IWHIR 2011), Yi-Qing Ni and Xiao-Wei Ye (eds.) 2012, pp. 53-70,</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Thomas Schlechte</submitter>
    <author>Thomas Schlechte</author>
    <author>Elmar Swarat</author>
    <series>
      <title>ZIB-Report</title>
      <number>11-35</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>railway models, railway capacity, track allocation framework</value>
    </subject>
    <collection role="msc" number="90C08">Special problems of linear programming (transportation, multi-index, etc.)</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="swarat">Swarat, Elmar</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/1403/ZR-11-35.pdf</file>
  </doc>
  <doc>
    <id>1448</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>deu</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2012-01-18</completedDate>
    <publishedDate>2012-01-18</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="deu">Optimierung des Linienplans 2010 in Potsdam</title>
    <abstract language="deu">Im Zuge der Übernahme von 6 Linien der Havelbus Verkehrsgesellschaft&#13;
mbH durch die ViP Verkehr in Potsdam GmbH ergab sich 2009 die Notwendigkeit der&#13;
Entwicklung eines neuen Linien- und Taktplans für das Jahr 2010.&#13;
Das Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)&#13;
entwickelt in einem Projekt des DFG-Forschungszentrums Matheon ein Verfahren zur mathematischen Linienoptimierung. Dieses Tool wurde bei der Optimierung des ViP Linienplans 2010 in&#13;
einer projektbegleitenden Studie eingesetzt, um Alternativen bei&#13;
verschiedenen Planungs- und Zielvorgaben auszuloten.&#13;
In dem Artikel wird eine Auswertung der Ergebnisse mit dem Verkehrsanalysesystem Visum der PTV AG beschrieben. Die Auswertungen bestätigen, dass mit Hilfe von mathematischer Optimierung eine  weitere Verkürzung der Reisezeit um 1%, eine&#13;
als um 6% verkürzt empfundene Reisezeit, 10% weniger Fahrzeit im&#13;
Fahrzeug und eine gleichzeitige Kostenreduktion um 5% möglich sind.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="serial">12-04</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-14486</identifier>
    <enrichment key="SourceTitle">Erschienen in: Der Nahverkehr 30/4 (2012) 34-39</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Karbstein Marika</submitter>
    <author>Isabel Friedow</author>
    <author>Marika Karbstein</author>
    <series>
      <title>ZIB-Report</title>
      <number>12-04</number>
    </series>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Fallstudie</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Linienplan</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Optimierung</value>
    </subject>
    <collection role="msc" number="90B06">Transportation, logistics</collection>
    <collection role="msc" number="90B20">Traffic problems</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/1448/ZR-12-04.pdf</file>
  </doc>
  <doc>
    <id>1456</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-01-25</completedDate>
    <publishedDate>2012-01-25</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Minimum Cost Hyperassignments with Applications to ICE/IC Rotation Planning</title>
    <abstract language="eng">Vehicle rotation planning is a fundamental problem in&#13;
  rail transport. It decides how the railcars, locomotives, and&#13;
  carriages are operated in order to implement the trips of the&#13;
  timetable.  One important planning requirement is operational&#13;
  regularity, i.e., using the rolling stock in the same way on every&#13;
  day of operation. We propose to take regularity into account by&#13;
  modeling the vehicle rotation planning problem as a minimum cost&#13;
  hyperassignment problem (HAP). Hyperassignments are generalizations&#13;
  of assignments from directed graphs to directed hypergraphs.&#13;
  Finding a minimum cost hyperassignment is&#13;
  NP-hard.&#13;
  Most instances arising from regular vehicle rotation planning, however, can&#13;
  be solved well in practice. We show that, in particular, clique&#13;
  inequalities strengthen the canonical LP relaxation substantially.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="serial">11-46</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-14564</identifier>
    <identifier type="url">http://link.springer.com/chapter/10.1007%2F978-3-642-29210-1_10</identifier>
    <enrichment key="SourceTitle">Appeared in: Klatte, D., Lüthi, H.-J., and Schmedders, K., editors, Operations Research Proceedings 2011, pages 59–64</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Olga Heismann</submitter>
    <author>Olga Heismann</author>
    <series>
      <title>ZIB-Report</title>
      <number>11-46</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>hyperassignments</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>vehicle rotation planning</value>
    </subject>
    <collection role="msc" number="05C65">Hypergraphs</collection>
    <collection role="msc" number="90B06">Transportation, logistics</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="projects" number="MATHEON-B22">MATHEON-B22</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1456/ZR 11-46.pdf</file>
  </doc>
  <doc>
    <id>1447</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-01-18</completedDate>
    <publishedDate>2012-01-18</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Note on Menger's Theorem for Hypergraphs</title>
    <abstract language="eng">We prove the companion Theorem to Menger's Theorem for&#13;
  hypergraphs. This result gives rise to a new class of blocking pairs&#13;
  of ideal matrices, that generalize the incidence matrices of cuts&#13;
  and paths.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="serial">12-03</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-14471</identifier>
    <author>Ralf Borndörfer</author>
    <submitter>Marika Karbstein</submitter>
    <author>Marika Karbstein</author>
    <series>
      <title>ZIB-Report</title>
      <number>12-03</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>ideal matrices</value>
    </subject>
    <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="projects" number="MATHEON-B15">MATHEON-B15</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1447/ZR-12-03.pdf</file>
  </doc>
  <doc>
    <id>1581</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>47</pageFirst>
    <pageLast>57</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>25</volume>
    <type>reportzib</type>
    <publisherName>Schloss Dagstuhl - Leibniz-Zentrum für Informatik</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2012-09-17</completedDate>
    <publishedDate>2012-09-17</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Direct Connection Approach to Integrated Line Planning and Passenger Routing</title>
    <abstract language="eng">The treatment of transfers is a major challenge in line planning. Existing models either route passengers and lines sequentially, and hence disregard essential degrees of freedom, or they are of&#13;
extremely large scale, and seem to be computationally intractable. We propose a novel direct connection approach that allows an integrated optimization of line and passenger routing, including accurate estimates of the number of direct travelers, for large-scale real-world instances.</abstract>
    <parentTitle language="eng">ATMOS 2012 - 12th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems</parentTitle>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-15812</identifier>
    <identifier type="doi">http://dx.doi.org/10.4230/OASIcs.ATMOS.2012.47</identifier>
    <enrichment key="SourceTitle">Appeared in: Proc. of the 12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2012), D. Delling, L. Liberti (eds.) pp. 47-57.  Open Access Series in Informatics, vol. 25</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Marika Karbstein</submitter>
    <editor>Daniel Delling</editor>
    <author>Marika Karbstein</author>
    <editor>Leo Liberti</editor>
    <series>
      <title>ZIB-Report</title>
      <number>12-29</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>combinatorial optimization</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>integer programming</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>line planning</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>transfers</value>
    </subject>
    <collection role="msc" number="90B20">Traffic problems</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="projects" number="MATHEON-B15">MATHEON-B15</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1581/ZR_12_29.pdf</file>
  </doc>
  <doc>
    <id>1174</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation>Matheon</contributingCorporation>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2010-06-14</completedDate>
    <publishedDate>2010-06-14</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Models for Line Planning with Transfers</title>
    <abstract language="eng">We propose a novel integer programming approach to transfer minimization for line planning problems in public transit. The idea is to incorporate penalties for transfers that are induced by “connection capacities” into the construction of the passenger paths. We show that such penalties can be dealt with by a combination of shortest and constrained shortest path algorithms such that the pricing problem for passenger paths can be solved efficiently. Connection capacity penalties (under)estimate the true transfer times. This error is, however, not a problem in practice. We show in a computational comparison with two standard models on a real-world scenario that our approach can be used to minimize passenger travel and transfer times for large-scale line planning problems with accurate results.</abstract>
    <identifier type="serial">10-11</identifier>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="opus3-id">1234</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-11742</identifier>
    <author>Ralf Borndörfer</author>
    <submitter>unknown unknown</submitter>
    <author>Marika Neumann</author>
    <series>
      <title>ZIB-Report</title>
      <number>10-11</number>
    </series>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Linienplanung</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Umsteigen</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Ganzzahlige Programmierung</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Kombinatorische Optimierung</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>line planning</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>transfers</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>integer programming</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>combinatorial optimization</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="msc" number="90B20">Traffic problems</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="projects" number="MATHEON-B15">MATHEON-B15</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/1174/ZR_10_11.pdf</file>
  </doc>
  <doc>
    <id>1183</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>deu</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2010-07-13</completedDate>
    <publishedDate>2010-07-13</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="deu">Linienoptimierung - reif für die Praxis?</title>
    <abstract language="deu">Wir stellen in dieser Arbeit ein mathematisches Optimierungsmodell zur Bestimmung eines optimalen Linienplans vor, das sowohl die Fahrzeiten und die Anzahl der Umstiege berücksichtigt als auch die Kosten des Liniennetzes. Dieses Modell deckt wichtige praktische Anforderungen ab, die in einem gemeinsamen Projekt mit den Verkehrsbetrieben in Potsdam (ViP) formuliert wurden. In diesem Projekt wurde der Linienplan 2010 für Potsdam entwickelt. Unsere Berechnungen zeigen, dass die mathematische Optimierung in nichts einer "Handplanung" des Liniennetzes nachsteht. Im Gegenteil, mit Hilfe des Optimierungsprogramms ist es möglich, durch Veränderung der Parameter mehrere verschiedene Szenarien zu berechnen, miteinander zu vergleichen und Aussagen über minimale Kosten und Fahrzeiten zu machen.</abstract>
    <identifier type="serial">10-20</identifier>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="opus3-id">1244</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-11832</identifier>
    <enrichment key="SourceTitle">App. in: HEUREKA '11, FGSV Verl. 2011. CD-ROM</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>unknown unknown</submitter>
    <author>Marika Neumann</author>
    <series>
      <title>ZIB-Report</title>
      <number>10-20</number>
    </series>
    <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/1183/ZR_10_20.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/1183/ZR_10_20.ps</file>
  </doc>
  <doc>
    <id>6453</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>--</completedDate>
    <publishedDate>2017-07-17</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Hypergraph Network Simplex Algorithm</title>
    <abstract language="eng">We describe a network simplex algorithm for the minimum cost flow problem on graph-based hypergraphs which are directed hypergraphs of a particular form occurring in railway rotation planning. The algorithm is based on work of Cambini, Gallo, and Scutellà who developed a hypergraphic generalization of the network simplex algorithm. Their main theoretical result is the characterization of basis matrices. We give a similar characterization for graph-based hypergraphs and show that some operations of the simplex algorithm can be done combinatorially by exploiting the underlying digraph structure.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-64539</identifier>
    <author>Isabel Beckenbach</author>
    <submitter>Isabel Beckenbach</submitter>
    <series>
      <title>ZIB-Report</title>
      <number>17-36</number>
    </series>
    <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/6453/zibreport17_36.pdf</file>
  </doc>
  <doc>
    <id>6594</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-11-23</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Timetable Sparsification by Rolling Stock Rotation Optimization</title>
    <abstract language="eng">Rolling stock optimization is a task that naturally arises by operating a railway system.&#13;
It could be seen with different level of details. From a strategic perspective to have a rough plan which types of fleets to be bought to a more operational perspective to decide which coaches have to be maintained first. This paper presents a new approach to deal with rolling stock optimisation in case of a (long term) strike. &#13;
Instead of constructing a completely new timetable for the strike period, we propose a mixed integer programming model that is able to choose appropriate trips from a given timetable to construct efficient tours of railway vehicles covering an optimized subset of trips, in terms of deadhead kilometers and importance of the trips. The decision which trip is preferred over the other is made by a simple evaluation method that is deduced from the network and trip defining data.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-65948</identifier>
    <author>Ralf Borndörfer</author>
    <submitter>Boris Grimm</submitter>
    <author>Matthias Breuer</author>
    <author>Boris Grimm</author>
    <author>Markus Reuther</author>
    <author>Stanley Schade</author>
    <author>Thomas Schlechte</author>
    <series>
      <title>ZIB-Report</title>
      <number>17-63</number>
    </series>
    <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/6594/ZR-17-63.pdf</file>
  </doc>
  <doc>
    <id>5746</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-02-15</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">An Extended Formulation for the Line Planning Problem</title>
    <abstract language="eng">In this paper we present a novel extended formulation for the line planning problem that is based on what we call “configurations” of lines and frequencies. Configurations account for all possible options to provide a required transportation capacity on an infrastructure edge. The proposed configuration model is strong in the sense that it implies several facet-defining inequalities for the standard model: set cover, symmetric band, MIR, and multicover inequalities. These theoretical findings can be confirmed in computational results. Further, we show how this concept can be generalized to define configurations for subsets of edges; the generalized model implies additional inequalities from the line planning literature.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-57467</identifier>
    <identifier type="doi">10.1007/978-3-319-42902-1_2</identifier>
    <enrichment key="SourceTitle">Appeared in: Operations Research Proceedings 2015 pp. 11-17</enrichment>
    <author>Heide Hoppmann</author>
    <submitter>Heide Hoppmann</submitter>
    <series>
      <title>ZIB-Report</title>
      <number>16-08</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Line Planning, Extended Formulation, Public Transport</value>
    </subject>
    <collection role="msc" number="90C11">Mixed 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="hoppmann">Hoppmann, Heide</collection>
    <collection role="projects" number="ECMath-MI3">ECMath-MI3</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/5746/hoppmann_An_Extended_Formulation_for_the_Line_Planning_Problem.pdf</file>
  </doc>
  <doc>
    <id>1117</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-02-24</completedDate>
    <publishedDate>2009-02-24</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">The Steiner Connectivity Problem</title>
    <abstract language="eng">The Steiner connectivity problem is a generalization of the Steiner tree problem. It consists in finding a minimum cost set of simple paths to connect a subset of nodes in an undirected graph. We show that polyhedral and algorithmic results on the Steiner tree problem carry over to the Steiner connectivity problem, namely, the Steiner cut and the Steiner partition inequalities, as well as the associated polynomial time separation algorithms, can be generalized. Similar to the Steiner tree case, a directed formulation, which is stronger than the natural undirected one, plays a central role.</abstract>
    <identifier type="serial">09-07</identifier>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="opus3-id">1166</identifier>
    <identifier type="doi">10.1007/s10107-012-0564-5</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-11171</identifier>
    <author>Ralf Borndörfer</author>
    <submitter>unknown unknown</submitter>
    <author>Marika Neumann</author>
    <author>Marc Pfetsch</author>
    <series>
      <title>ZIB-Report</title>
      <number>09-07</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Steiner Tree</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Partition Inequalities</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Paths</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Connectivity</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Generalization</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</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/1117/ZR_09_07.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/1117/ZR_09_07.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/1117/ZR-09-07revised.pdf</file>
  </doc>
  <doc>
    <id>1114</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-02-13</completedDate>
    <publishedDate>2009-02-13</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Fare Planning for Public Transport</title>
    <abstract language="eng">In this paper we investigate the fare planning model for public transport, which consists in designing a system of fares maximizing the revenue. We discuss a discrete choice model in which passengers choose between different travel alternatives to express the demand as a function of fares. Furthermore, we give a computational example for the city of Potsdam and discuss some theoretical aspects.</abstract>
    <identifier type="serial">09-04</identifier>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="opus3-id">1160</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-11144</identifier>
    <enrichment key="SourceTitle">Appeared in: Operations Research Proceedings 2006. K. H. Waldmann, U. M. Stocker (eds.) Springer 2007, pp. 61-66</enrichment>
    <author>Marika Neumann</author>
    <submitter>unknown unknown</submitter>
    <series>
      <title>ZIB-Report</title>
      <number>09-04</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>fares</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>descrete choice</value>
    </subject>
    <collection role="ddc" number="510">Mathematik</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="institutes" number="traffic">Mathematics of Transportation and Logistics</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/1114/ZR_09_04.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/1114/ZR_09_04.ps</file>
  </doc>
  <doc>
    <id>725</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-03-06</completedDate>
    <publishedDate>2003-03-06</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Combinatorial Packing Problems</title>
    <abstract language="eng">This article investigates a certain class of combinatorial packing problems and some polyhedral relations between such problems and the set packing problem.</abstract>
    <identifier type="serial">03-03</identifier>
    <identifier type="opus3-id">726</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-7255</identifier>
    <enrichment key="SourceTitle">Appeared in: The Sharpest Cut: The Impact of Manfred Padberg and his Work. Ed. By Martin Grötschel. Philadelphia: Society for Industrial and Applied Mathematics 2004. Pp. 19-32</enrichment>
    <author>Ralf Borndörfer</author>
    <series>
      <title>ZIB-Report</title>
      <number>03-03</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Packing problems</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>polyhedral combinatorics</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</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="SenWiFo-Telebus">SenWiFo-Telebus</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/725/ZR-03-03.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/725/ZR-03-03.pdf</file>
  </doc>
  <doc>
    <id>869</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-08-01</completedDate>
    <publishedDate>2005-08-01</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Optimal Fares for Public Transport</title>
    <abstract language="eng">The \emph{fare planning problem} for public transport is to design a system of fares that maximize the revenue. We introduce a nonlinear optimization model to approach this problem. It is based on a d iscrete choice logit model that expresses demand as a function of the fares. We illustrate our approach by computing and comparing two different fare systems for the intercity network of the Netherlands.</abstract>
    <identifier type="serial">05-35</identifier>
    <identifier type="opus3-id">869</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-8698</identifier>
    <enrichment key="SourceTitle">Appeared in: Operations Research Proceedings 2005. H.-D. Haasis et al. (eds.) Springer 2006, 591-596</enrichment>
    <author>Ralf Borndörfer</author>
    <author>Marika Neumann</author>
    <author>Marc Pfetsch</author>
    <series>
      <title>ZIB-Report</title>
      <number>05-35</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/869/ZR-05-35.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/869/ZR-05-35.ps</file>
  </doc>
  <doc>
    <id>5100</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-09-07</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Coarse-To-Fine Approach to the Railway Rolling Stock Rotation Problem</title>
    <abstract language="eng">We propose a new coarse-to-fine approach to solve certain linear programs by column generation. The problems that we address contain layers corresponding to different levels of detail, i.e., coarse layers as well as fine layers. These layers are utilized to design&#13;
  efficient pricing rules. In a nutshell, the method shifts the pricing of a fine linear program to a coarse counterpart. In this way, major decisions are taken in the coarse layer, while minor&#13;
  details are tackled within the fine layer. We elucidate our methodology by an application to a complex railway rolling stock rotation problem. We provide comprehensive computational results that demonstrate the benefit of this new technique for the solution of large scale problems.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-51009</identifier>
    <author>Ralf Borndörfer</author>
    <submitter>Thomas Schlechte</submitter>
    <author>Markus Reuther</author>
    <author>Thomas Schlechte</author>
    <series>
      <title>ZIB-Report</title>
      <number>14-26</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>column generation</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>coarse-to-fine approach</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>multi-layer approach</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>rolling stock rotation problem</value>
    </subject>
    <collection role="ccs" number="G.">Mathematics of Computing</collection>
    <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="schlechte">Schlechte, Thomas</collection>
    <collection role="projects" number="MODAL-RailLab">MODAL-RailLab</collection>
    <collection role="projects" number="ROTOR">ROTOR</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/5100/ZR-14-26.pdf</file>
  </doc>
  <doc>
    <id>5028</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>deu</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>2014-05-22</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="deu">Mathematik im Verkehr</title>
    <abstract language="deu">Nach einem kurzen Abriss über die Bedeutung des Verkehrssektors als eine wichtige Schlüsseltechnologie im gesamten Verlauf der Menschheitsgeschichte skizzieren wir die Rolle der Mathematik für Verkehr und Transport. Wir spekulieren dann über zukünftige Entwicklungen, insbesondere im Bereich des öffentlichen Personenverkehrs, und begründen, dass die in diesem Bereich anstehenden Herausforderungen nur mit dem Einsatz mathematischer Methoden angemessen bewältigt werden können. Die demographischen Prozesse, die in verschiedenen Teilen der Welt unterschiedlich verlaufen, wie z.B. Überalterung in Europa oder dynamische Trends zu Megastädten in Entwicklungsländern, sich ändernde Lebens- und Produktionsverhältnisse, stark wachsender Bedarf nach Mobilität und enormes Anwachsen der Komplexität der Verkehrsplanung und -durchführung, machen einen verstärkten Zugriff auf mathematische Modellierung, Simulation und Optimierung notwendig. Diese Entwicklung stellt sowohl große Herausforderungen an die Mathematik, wo vielfach noch keine geeigneten Methoden vorhanden sind, als auch an die Praktiker im Bereich von Verkehr und Transport, die sich mit neuen Planungs- und Steuerungstechnologien befassen und diese effizient einsetzen müssen. Hier wird intensive Kooperation zwischen vielen beteiligten Akteuren gefragt sein.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-50287</identifier>
    <enrichment key="SourceTitle">Appeared in: HEUREKA '14. FGSV  Verl.	2014, ISBN 978-3-86446-074-6 Vorträge der Tagung am 2./3. April 2014 in Stuttgart</enrichment>
    <author>Martin Grötschel</author>
    <submitter>Regine Kossick</submitter>
    <author>Ralf Borndörfer</author>
    <series>
      <title>ZIB-Report</title>
      <number>14-03</number>
    </series>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Optimierung</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>öffentlicher Verkehr</value>
    </subject>
    <collection role="msc" number="90-02">Research exposition (monographs, survey articles)</collection>
    <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="groetschel">Grötschel, Martin</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/5028/ZR-14-03.pdf</file>
  </doc>
  <doc>
    <id>5027</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>deu</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>2014-05-22</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="deu">Integrierte Dienst- und Dienstreihenfolgeplanung zur Erhöhung der Fahrerzufriedenheit</title>
    <abstract language="deu">Wir stellen einen mathematischen Optimierungsansatz zur integrierten Dienst- und Dienstreihenfolgeplanung&#13;
im öffentlichen Nahverkehr vor, mit dem sich bei konstanten Personalkosten&#13;
die Fahrerzufriedenheit deutlich steigern lässt.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-50270</identifier>
    <enrichment key="SourceTitle">Appeared in: Straßenverkehrstechnik. (2014) pp. 583-591</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Regine Kossick</submitter>
    <author>Bastian Dittbrenner</author>
    <author>Andreas Langenhan</author>
    <author>Stephan Seidl</author>
    <author>Steffen Weider</author>
    <series>
      <title>ZIB-Report</title>
      <number>14-02</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>duty scheduling</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>duty rostering</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>integrated scheduling</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Benders' decomposition</value>
    </subject>
    <collection role="ccs" number="J.2">PHYSICAL SCIENCES AND ENGINEERING</collection>
    <collection role="ccs" number="G.1.6">Optimization</collection>
    <collection role="msc" number="90B20">Traffic problems</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="weider">Weider, Steffen</collection>
    <collection role="projects" number="WS-OPT">WS-OPT</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/5027/ZR-14-02.pdf</file>
  </doc>
  <doc>
    <id>5101</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-07-16</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Generalization of Odd Set Inequalities for the Set Packing Problem</title>
    <abstract language="eng">The set packing problem, sometimes also called the stable set problem, is a well-known NP-hard problem in combinatorial optimization with a wide range of applications and an interesting polyhedral structure, that has been the subject of intensive study. We contribute to this field by showing how, employing cliques, odd set inequalities for the matching problem can be generalized to valid inequalities for the set packing polytope with a clear combinatorial meaning.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="doi">10.1007/978-3-319-07001-8_26</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-51010</identifier>
    <enrichment key="SourceTitle">Appeared in: Operations Research Proceedings 2013 pp 193-199</enrichment>
    <author>Olga Heismann</author>
    <submitter>Olga Heismann</submitter>
    <author>Ralf Borndörfer</author>
    <series>
      <title>ZIB-Report</title>
      <number>14-28</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>set packing</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>matching</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>hypergraph</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>inequality</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>facet</value>
    </subject>
    <collection role="msc" number="90C10">Integer programming</collection>
    <collection role="msc" number="90C27">Combinatorial optimization</collection>
    <collection role="msc" number="90C57">Polyhedral combinatorics, branch-and-bound, branch-and-cut</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-B22">MATHEON-B22</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/5101/ZR 14-28.pdf</file>
  </doc>
  <doc>
    <id>5673</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-12-07</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Passenger Routing for Periodic Timetable Optimization</title>
    <abstract language="eng">The task of periodic timetabling is to schedule the trips in a public transport system by determining arrival and departure times at every station such that travel and transfer times are minimized. To date, the optimization literature generally assumes that passengers do not respond to changes in the timetable, i.e., the passenger routes are fixed. This is unrealistic and ignores potentially valuable degrees of freedom. We investigate in this paper periodic timetabling models with integrated passenger routing. We show that different routing models have a huge influence on the quality of the entire system: Whatever metric is applied, the performance ratios of timetables w.r.t. to different routing models can be arbitrarily large. Computations on a real-world instance for the city of Wuppertal substantiate the theoretical findings. These results indicate the existence of untapped optimization potentials that can be used to improve the efficiency of public transport systems.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-56739</identifier>
    <identifier type="doi">10.1007/s12469-016-0132-0</identifier>
    <enrichment key="SourceTitle">Public Transport, 2016</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter> Hoppmann</submitter>
    <author>Heide Hoppmann</author>
    <author>Marika Karbstein</author>
    <series>
      <title>ZIB-Report</title>
      <number>15-55</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Passenger routing</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Periodic timetabling</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Public transport</value>
    </subject>
    <collection role="msc" number="90B06">Transportation, logistics</collection>
    <collection role="msc" number="90C11">Mixed 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="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/5673/borndoerferHoppmannKarbstein_publicTransport_ZTP.pdf</file>
  </doc>
  <doc>
    <id>5543</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>deu</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>2015-06-22</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="deu">Neue Planungsinstrumente nutzen: Das Verkehrsangebot verbessern und Kosten sparen</title>
    <abstract language="deu">Wir illustrieren anhand des Liniennetzes der Stadt Potsdam das Potenzial mathematischer Methoden der Angebotsplanung. Wir zeigen,&#13;
dass das "bestmögliche" Verkehrsangebot stark von planerischen Vorgaben beeinflusst wird, mit denen man die Erreichung unterschiedlicher und teilweise gegenläufiger Ziele steuern kann. Die Komplexität des Systems führt zum Auftreten von Rückkoppelungseffekten, die man nicht mit Hilfe von Daumenregeln beherrschen kann. Vielmehr ist der Einsatz moderner Planungsverfahren in einer interdisziplinären Zusammenarbeit von politischen Entscheidungsträgern, Verkehrsingenieuren und Mathematikern notwendig, um die aktuellen Herausforderungen in der Verkehrsplanung zu meistern. Der Artikel dokumentiert einen Beitrag zum 7. ÖPNV Innovationskongress des Ministeriums für Verkehr und Infrastruktur des Landes Baden-Württemberg, der vom 9.-11. März 2015 in Freiburg stattfand.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-55439</identifier>
    <enrichment key="SourceTitle">Ersch. in: Verkehr und Technik 68/7 (2015) S. 239-243</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Marika Karbstein</submitter>
    <author>Marika Karbstein</author>
    <series>
      <title>ZIB-Report</title>
      <number>15-33</number>
    </series>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Linienplan</value>
    </subject>
    <subject>
      <language>deu</language>
      <type>uncontrolled</type>
      <value>Optimierung</value>
    </subject>
    <collection role="msc" number="90B06">Transportation, logistics</collection>
    <collection role="msc" number="90B20">Traffic problems</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="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/5543/ZR-15-33.pdf</file>
  </doc>
  <doc>
    <id>5530</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-06-04</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Timetabling and Passenger Routing in Public Transport</title>
    <abstract language="eng">The task of timetabling is to schedule the trips in a public transport system by determining periodic arrival and departure times at every station. The goal is to provide a service that is both attractive for passengers and can be operated economically. To date, timetable optimization is generally done with respect to fixed passenger routes, i.e., it is assumed that passengers do not respond to changes in the timetable. This is unrealistic and ignores potentially valuable degrees of freedom. We investigate in this paper periodic timetabling models with integrated passenger routing. We propose several models that differ in the allowed passenger paths and the objectives. We compare these models theoretically and report on computations on real-world instances for the city of Wuppertal.</abstract>
    <parentTitle language="eng">Appeard in: Proceedings of Conference on Advanced Systems in Public Transport 2015 (CASPT2015)</parentTitle>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-55305</identifier>
    <enrichment key="SourceTitle">Proceedings of Conference on Advanced Systems in Public Transport 2015 (CASPT2015)</enrichment>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Heide Hoppmann</submitter>
    <author>Heide Hoppmann</author>
    <author>Marika Karbstein</author>
    <series>
      <title>ZIB-Report</title>
      <number>15-31</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Passenger routing</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Periodic timetabling</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Public transport</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="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/5530/ZR-15-31.pdf</file>
  </doc>
  <doc>
    <id>6200</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>deu</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>2017-02-23</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="deu">Umsteigen ohne Warten</title>
    <abstract language="deu">Wir stellen einen mathematischen Optimierungsansatz zur Berechnung von periodischen Taktfahrplänen vor, bei dem die Umsteigezeiten unter&#13;
Berücksichtigung des Passagierverhaltens minimiert werden. Wir untersuchen damit den Einfluss wichtiger Systemparameter und Verhaltensmuster auf die Beförderungsqualität.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-62006</identifier>
    <author>Ralf Borndörfer</author>
    <submitter>Marika Karbstein</submitter>
    <author>Heide Hoppmann</author>
    <author>Marika Karbstein</author>
    <series>
      <title>ZIB-Report</title>
      <number>17-05</number>
    </series>
    <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="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="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/6200/ZR_17-05.pdf</file>
  </doc>
  <doc>
    <id>5280</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-10-15</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Optimal Designs for Steady-state Kalman filters</title>
    <abstract language="eng">We consider a stationary discrete-time linear process that can be observed by a finite number of sensors.&#13;
The experimental design for the observations consists of an allocation of available resources to these sensors.&#13;
We formalize the problem of selecting a design that maximizes the information matrix of the steady-state of the Kalman filter,&#13;
with respect to a standard optimality criterion, such as $D-$ or $A-$optimality.&#13;
This problem generalizes the optimal experimental design problem for a linear regression model with a finite design space and uncorrelated errors.&#13;
Finally, we show that under natural assumptions, a steady-state optimal design can be computed by semidefinite programming.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-52808</identifier>
    <author>Guillaume Sagnol</author>
    <submitter>Guillaume Sagnol</submitter>
    <author>Radoslav Harman</author>
    <series>
      <title>ZIB-Report</title>
      <number>14-39</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Optimal Design</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Kalman Filter</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Semidefinite programming</value>
    </subject>
    <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="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/5280/optdes_filtering_smsa-zib.pdf</file>
  </doc>
  <doc>
    <id>5298</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-10-31</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Integrated Line Planning and Passenger Routing: Connectivity and Transfers</title>
    <abstract language="eng">The integrated line planning and passenger routing problem is an important planning problem in service design of public transport. A major challenge is the treatment of transfers. A main property of a line system is its connectivity. &#13;
In this paper we show that analysing the connecvitiy aspect of a line plan gives a new idea to handle the transfer aspect of the line planning problem.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-52986</identifier>
    <identifier type="doi">10.1007/978-3-319-28697-6_37</identifier>
    <enrichment key="SourceTitle">Appeared in: Operations Research Proceedings 2014  Part of the series Operations Research Proceedings pp 263-269</enrichment>
    <author>Marika Karbstein</author>
    <submitter>Marika Karbstein</submitter>
    <series>
      <title>ZIB-Report</title>
      <number>14-42</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>line planning, transfers,Steiner connectivity problem</value>
    </subject>
    <collection role="msc" number="90B20">Traffic problems</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="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/5298/ZR_14_42.pdf</file>
  </doc>
  <doc>
    <id>7971</id>
    <completedYear>2021</completedYear>
    <publishedYear>2021</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2021-06-18</completedDate>
    <publishedDate>2021-06-18</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">An Improved Multiobjective Shortest Path Algorithm</title>
    <abstract language="eng">We present a new label-setting algorithm for the Multiobjective Shortest Path (MOSP) problem that computes the minimal complete set of efficient paths for a given instance. The size of the priority queue used in the algorithm is bounded by the number of nodes in the input graph and extracted labels are guaranteed to be efficient. These properties allow us to give a tight output-sensitive running time bound for the new algorithm that can almost be expressed in terms of the running time of Dijkstra's algorithm for the Shortest Path problem. Hence, we suggest to call the algorithm \emph{Multiobjective Dijkstra Algorithm} (MDA). The simplified label management in the MDA allows us to parallelize some subroutines. In our computational experiments, we compare the MDA and the classical label-setting MOSP algorithm by Martins', which we improved using new data structures and pruning techniques. On average, the MDA is $\times2$ to $\times9$ times faster on all used graph types. On some instances the speedup reaches an order of magnitude.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-79712</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="opus.source">publish</enrichment>
    <submitter>Pedro Maristany de las Casas</submitter>
    <author>Pedro Maristany de las Casas</author>
    <author>Antonio Sedeno-Noda</author>
    <author>Ralf Borndörfer</author>
    <series>
      <title>ZIB-Report</title>
      <number>20-26</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Multiobjective Shortest Path Problem</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Output-Sensitive Multiobjective Combinatorial Problems</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Network Optimization</value>
    </subject>
    <collection role="ccs" number="G.2">DISCRETE MATHEMATICS</collection>
    <collection role="msc" number="05C85">Graph algorithms [See also 68R10, 68W05]</collection>
    <collection role="msc" number="68R10">Graph theory (including graph drawing) [See also 05Cxx, 90B10, 90B35, 90C35]</collection>
    <collection role="msc" number="90-02">Research exposition (monographs, survey articles)</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="LHS-ATN">LHS-ATN</collection>
    <collection role="persons" number="maristany">Maristany de las Casas, Pedro</collection>
    <collection role="projects" number="MODAL-Gesamt">MODAL-Gesamt</collection>
    <collection role="institutes" number="neo">Network Optimization</collection>
    <collection role="projects" number="MODAL-MobilityLab">MODAL-MobilityLab</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/7971/main.pdf</file>
  </doc>
  <doc>
    <id>8134</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>2020-12-20</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Discrete-Continuous Algorithm for Free Flight Planning</title>
    <abstract language="eng">We propose a hybrid discrete-continuous algorithm for flight planning in free flight airspaces. In a first step, our DisCOptER method discrete-continuous optimization for enhanced resolution) computes a globally optimal approximate flight path on a discretization of the problem using the A* method. This route initializes a Newton method that converges rapidly to the smooth optimum in a second step. The correctness, accuracy, and complexity of the method are goverened by the choice of the crossover point that determines the coarseness of the discretization. We analyze the optimal choice of the crossover point and demonstrate the asymtotic superority of DisCOptER over a purely discrete approach.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="doi">10.3390/a14010004</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-81343</identifier>
    <enrichment key="opus.source">publish</enrichment>
    <enrichment key="SourceTitle">Algorithms</enrichment>
    <enrichment key="AcceptedDate">2020-12-20</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Fabian Danecker</submitter>
    <author>Fabian Danecker</author>
    <author>Martin Weiser</author>
    <series>
      <title>ZIB-Report</title>
      <number>20-33</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>shortest path</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>flight planning</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>free flight</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>discrete-continuous algorithm</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>optimal control</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>discrete optimization</value>
    </subject>
    <collection role="msc" number="49M37">Methods of nonlinear programming type [See also 90C30, 65Kxx]</collection>
    <collection role="msc" number="65K10">Optimization and variational techniques [See also 49Mxx, 93B40]</collection>
    <collection role="msc" number="65L10">Boundary value problems</collection>
    <collection role="msc" number="90C27">Combinatorial optimization</collection>
    <collection role="msc" number="90C35">Programming involving graphs or networks [See also 90C27]</collection>
    <collection role="institutes" number="compmed">Computational Medicine</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="weiser">Weiser, Martin</collection>
    <collection role="institutes" number="MfLMS">Mathematics for Life and Materials Science</collection>
    <collection role="institutes" number="MSoCP">Modeling and Simulation of Complex Processes</collection>
    <collection role="institutes" number="Mathematical Algorithmic Intelligence">Mathematical Algorithmic Intelligence</collection>
    <collection role="institutes" number="neo">Network Optimization</collection>
    <collection role="projects" number="MathPlus-AA3-3">MathPlus-AA3-3</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/8134/BorndoerferDaneckerWeiser2020.pdf</file>
  </doc>
  <doc>
    <id>292</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>1997-05-23</completedDate>
    <publishedDate>1997-05-23</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Telebus Berlin: Vehicle Scheduling in a Dial-a-Ride System</title>
    <abstract language="eng">{\em Telebus\/} is Berlin's dial-a-ride system for handicapped people that cannot use the public transportation system. The service is provided by a fleet of about 100 mini-busses and includes aid to get in and out of the vehicle. Telebus has between 1,000 and 1,500 transportation requests per day. The problem arises to schedule these requests into the vehicles such that punctual service is provided while operation costs should be minimum. Additional constraints include pre-rented vehicles, fixed bus driver shift lengths, obligatory breaks, and different vehicle capacities. We use a {\em set partitioning\/} approach for the solution of the bus scheduling problem that consists of two steps. The first {\em clustering\/} step identifies segments of possible bus tours (``orders'') such that more than one person is transported at a time; the aim in this step is to reduce the size of the problem and to make use of larger vehicle capacities. The problem to select a set of orders such that the traveling distance of the vehicles within the orders is minimal is a set partitioning problem that we can solve to optimality. In the second step the selected orders are {\em chained\/} to yield possible bus tours respecting all side constraints. The problem to select a set of such bus tours such that each order is serviced once and the total traveling distance of the vehicles is minimum is again a set partitioning problem that we solve approximately. We have developed a computer system for the solution of the bus scheduling problem that includes a branch-and-cut algorithm for the solution of the set partitioning problems. A version of this system is in operation at Telebus since July 1995. Its use made it possible that Telebus can service today about 30\% more requests per day for the same amount of money than before.</abstract>
    <identifier type="serial">SC-97-23</identifier>
    <identifier type="opus3-id">293</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-2925</identifier>
    <identifier type="doi">10.1007/978-3-642-85970-0_19</identifier>
    <enrichment key="SourceTitle">Appeared in: Lecture Notes in Economics and Mathematical Systems, Proc. of the 7th Int. Workshop on Computer-Aided Transit Scheduling (N. Wilson, Hrsg.), Springer, Berlin (1999) 391-422</enrichment>
    <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>SC-97-23</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>
    <file>https://opus4.kobv.de/opus4-zib/files/292/SC-97-23.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/292/SC-97-23.pdf</file>
  </doc>
  <doc>
    <id>279</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>deu</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>1997-03-03</completedDate>
    <publishedDate>1997-03-03</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="deu">Optimierung des Berliner Behindertenfahrdienstes</title>
    <abstract language="deu">In diesem Artikel geben wir einen Überblick über das Telebus-Projekt am Konrad-Zuse-Zentrum, Berlin, durch das der Behindertenfahrdienst in Berlin reorganisiert und optimiert wurde. Wir berichten kurz über die mathematischen Probleme und, etwas ausführlicher, über die nicht-mathematischen Schwierigkeiten, die bei der Durchführung dieses Projektes auftraten.</abstract>
    <identifier type="serial">SC-97-10</identifier>
    <identifier type="opus3-id">280</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-2799</identifier>
    <enrichment key="SourceTitle">Erschienen in: Mitteilungen der Deutschen Mathematiker-Vereinigung 2 (1997) 38-43</enrichment>
    <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>SC-97-10</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>
    <file>https://opus4.kobv.de/opus4-zib/files/279/SC-97-10.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/279/SC-97-10.pdf</file>
  </doc>
</export-example>
