<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>870</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">Routing in Line Planning for Public Transportation</title>
    <abstract language="eng">The line planning problem is one of the fundamental problems in strategic planning of public and rail transport. It consists in finding lines and corresponding frequencies in a network such that a giv en demand can be satisfied. There are two objectives. Passengers want to minimize travel times, the transport company wishes to minimize operating costs. We investigate three variants of a multi-commo dity flow model for line planning that differ with respect to passenger routings. The first model allows arbitrary routings, the second only unsplittable routings, and the third only shortest path rou tings with respect to the network. We compare these models theoretically and computationally on data for the city of Potsdam.</abstract>
    <identifier type="serial">05-36</identifier>
    <identifier type="opus3-id">870</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-8706</identifier>
    <enrichment key="SourceTitle">Appeared in: Operations Research Proceedings 2005. H.-D. Haasis et al. (eds.) Springer 2006, 405-410</enrichment>
    <author>Marc Pfetsch</author>
    <author>Ralf Borndörfer</author>
    <series>
      <title>ZIB-Report</title>
      <number>05-36</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>line planning</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>column generation</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>passenger routing</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="msc" number="90B06">Transportation, logistics</collection>
    <collection role="msc" number="90C27">Combinatorial optimization</collection>
    <collection role="institutes" number="">ZIB Allgemein</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>
    <file>https://opus4.kobv.de/opus4-zib/files/870/ZR-05-36.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/870/ZR-05-36.ps</file>
  </doc>
  <doc>
    <id>852</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-17</completedDate>
    <publishedDate>2005-03-17</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Column-Generation Approach to Line Planning in Public Transport</title>
    <abstract language="eng">The line planning problem is one of the fundamental problems in strategic planning of public and rail transport. It consists in finding lines and corresponding frequencies in a transport network such that a given travel demand can be satisfied. There are (at least) two objectives. The transport company wishes to minimize operating costs, the passengers want to minimize travel times. We propose a n ew multi-commodity flow model for line planning. Its main features, in comparison to existing models, are that the passenger paths can be freely routed and that the lines are generated dynamically. We discuss properties of this model and investigate its complexity. Results with data for the city of Potsdam, Germany, are reported.</abstract>
    <identifier type="serial">05-18</identifier>
    <identifier type="opus3-id">852</identifier>
    <identifier type="doi">/10.1287/trsc.1060.0161</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-8522</identifier>
    <enrichment key="SourceTitle">Appeared in: Transportation Science 41 (2007) 123-132</enrichment>
    <author>Ralf Borndörfer</author>
    <author>Martin Grötschel</author>
    <author>Marc Pfetsch</author>
    <series>
      <title>ZIB-Report</title>
      <number>05-18</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>line planning</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>column generation</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="msc" number="90B06">Transportation, logistics</collection>
    <collection role="msc" number="90C27">Combinatorial optimization</collection>
    <collection role="institutes" number="">ZIB Allgemein</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="persons" number="groetschel">Grötschel, Martin</collection>
    <collection role="projects" number="MATHEON-B1">MATHEON-B1</collection>
    <collection role="projects" number="MATHEON-B15">MATHEON-B15</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/852/ZR-05-18.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/852/ZR_05_18.orig.Vers.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/852/ZR-05-18.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/852/ZR_05_18.orig.Vers.ps</file>
  </doc>
  <doc>
    <id>856</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">Public Transport to the fORe!</title>
    <abstract language="eng">Can OR methods help the public transport industry to break even? The article gives evidence that there exist significant potentials in this direction, which can be harnessed by a combination of modern mathematical methods and local planning knowledge. Many of the planning steps in public transport are classical combinatorial problems, which can be solved in unprecedented size and quality due the rapid progress in large-scale optimization. Three examples on vehicle scheduling, duty scheduling, and integrated vehicle and duty scheduling illustrate the level that has been reached and the improvements that can be achieved today. Extensions of such methods to further questions of strategic, online, and market-oriented planning are currently investigated. In this way, OR can make a significant contribution to answer the basic but extremely difficult question ``What is a good public transport network?.</abstract>
    <identifier type="serial">05-22</identifier>
    <identifier type="opus3-id">856</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-8562</identifier>
    <identifier type="url">http://www.lionhrtpub.com/orms/orms-4-06/frtransport.html</identifier>
    <enrichment key="SourceTitle">Appeared in: OR/MS Today, Apr 2006, Vol 33 (2), 30-40</enrichment>
    <author>Ralf Borndörfer</author>
    <author>Martin Grötschel</author>
    <author>Marc Pfetsch</author>
    <series>
      <title>ZIB-Report</title>
      <number>05-22</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Public transport</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>vehicle scheduling</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>duty scheduling</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="msc" number="90B20">Traffic problems</collection>
    <collection role="institutes" number="">ZIB Allgemein</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="persons" number="groetschel">Grötschel, Martin</collection>
    <collection role="projects" number="MATHEON-B1">MATHEON-B1</collection>
    <collection role="projects" number="MATHEON-B15">MATHEON-B15</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/856/ZR-05-22.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/856/ZR-05-22.ps</file>
  </doc>
  <doc>
    <id>2866</id>
    <completedYear>2008</completedYear>
    <publishedYear>2008</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>363</pageFirst>
    <pageLast>378</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>600</volume>
    <type>conferenceobject</type>
    <publisherName>Springer-Verlag</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Models for Line Planning in Public Transport</title>
    <parentTitle language="eng">Computer-aided Systems in Public Transport (CASPT 2004)</parentTitle>
    <identifier type="doi">10.1007/978-3-540-73312-6_18</identifier>
    <enrichment key="Series">Lecture Notes in Economics and Mathematical Systems</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-7854</enrichment>
    <author>Ralf Borndörfer</author>
    <editor>Mark Hickman</editor>
    <author>Martin Grötschel</author>
    <editor>Pitu Mirchandani</editor>
    <author>Marc Pfetsch</author>
    <editor>Stefan Voß</editor>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="persons" number="groetschel">Grötschel, Martin</collection>
    <collection role="projects" number="MATHEON-B1">MATHEON-B1</collection>
    <collection role="projects" number="MATHEON-B15">MATHEON-B15</collection>
  </doc>
  <doc>
    <id>3174</id>
    <completedYear>2007</completedYear>
    <publishedYear>2007</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>123</pageFirst>
    <pageLast>132</pageLast>
    <pageNumber/>
    <edition/>
    <issue>1</issue>
    <volume>41</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">A Column-Generation Approach to Line Planning in Public Transport</title>
    <parentTitle language="eng">Transportation Science (INFORMS)</parentTitle>
    <identifier type="doi">10.1287/trsc.1060.0161</identifier>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-8522</enrichment>
    <author>Ralf Borndörfer</author>
    <author>Martin Grötschel</author>
    <author>Marc Pfetsch</author>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="persons" number="groetschel">Grötschel, Martin</collection>
    <collection role="projects" number="MATHEON-B1">MATHEON-B1</collection>
    <collection role="projects" number="MATHEON-B15">MATHEON-B15</collection>
  </doc>
  <doc>
    <id>4860</id>
    <completedYear/>
    <publishedYear>2012</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>2591</pageFirst>
    <pageLast>2605</pageLast>
    <pageNumber/>
    <edition/>
    <issue>18</issue>
    <volume>160</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Models for Fare Planning in Public Transport</title>
    <parentTitle language="eng">Discrete Applied Mathematics</parentTitle>
    <identifier type="doi">10.1016/j.dam.2012.02.027</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-10708</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Marika Karbstein</submitter>
    <author>Marika Karbstein</author>
    <author>Marc Pfetsch</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="institutes" number="traffic">Mathematics of Transportation and Logistics</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="projects" number="MATHEON-B15">MATHEON-B15</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>785</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>2004-04-20</completedDate>
    <publishedDate>2004-04-20</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Models for Line Planning in Public Transport</title>
    <abstract language="eng">The \emph{line planning problem} is one of the fundamental problems in strategic planning of public and rail transport. It consists of finding lines and corresponding frequencies in a public transport network such that a given travel demand can be satisfied. There are (at least) two objectives. The transport company wishes to minimize its operating cost; the passengers request short travel times. We propose two new multi-commodity flow models for line planning. Their main features, in comparison to existing models, are that the passenger paths can be freely routed and that the lines are generated dynamically.</abstract>
    <identifier type="serial">04-10</identifier>
    <identifier type="opus3-id">786</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-7854</identifier>
    <identifier type="doi">10.1007/978-3-540-73312-6_18</identifier>
    <enrichment key="SourceTitle">Appeared in: Computer-aided Systems in Public Transport. Mark Hickman, Pitu Mirchandani, Stefan Voss (eds.) Lecture Notes in Economics and Mathematical Systems, 600, 2008, pp. 363-378</enrichment>
    <author>Ralf Borndörfer</author>
    <author>Martin Grötschel</author>
    <author>Marc Pfetsch</author>
    <series>
      <title>ZIB-Report</title>
      <number>04-10</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>line planning</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>column generation</value>
    </subject>
    <collection role="ddc" number="000">Informatik, Informationswissenschaft, allgemeine Werke</collection>
    <collection role="msc" number="90B06">Transportation, logistics</collection>
    <collection role="msc" number="90C27">Combinatorial optimization</collection>
    <collection role="institutes" number="traffic">Mathematics of Transportation and Logistics</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="persons" number="groetschel">Grötschel, Martin</collection>
    <collection role="projects" number="MATHEON-B1">MATHEON-B1</collection>
    <collection role="projects" number="MATHEON-B15">MATHEON-B15</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/785/ZR-04-10.ps</file>
    <file>https://opus4.kobv.de/opus4-zib/files/785/ZR-04-10.pdf</file>
  </doc>
  <doc>
    <id>3234</id>
    <completedYear>2009</completedYear>
    <publishedYear>2009</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue>09261</issue>
    <volume/>
    <type>conferenceobject</type>
    <publisherName>Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany</publisherName>
    <publisherPlace>Dagstuhl, Germany</publisherPlace>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Line Planning and Connectivity</title>
    <parentTitle language="eng">Models and Algorithms for Optimization in Logistics</parentTitle>
    <enrichment key="Series">Dagstuhl Seminar Proceedings</enrichment>
    <enrichment key="PeerReviewed">yes</enrichment>
    <author>Ralf Borndörfer</author>
    <editor>Cynthia Barnhart</editor>
    <author>Marika Neumann</author>
    <editor>Uwe Clausen</editor>
    <author>Marc Pfetsch</author>
    <editor>Ulrich Lauther</editor>
    <editor>Rolf Möhring</editor>
    <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>
  </doc>
  <doc>
    <id>3228</id>
    <completedYear>2006</completedYear>
    <publishedYear>2006</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>29</pageFirst>
    <pageLast>36</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>bookpart</type>
    <publisherName>Springer-Verlag</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Optimal Fares for Public Transport</title>
    <parentTitle language="eng">Operations Research Proceedings 2005</parentTitle>
    <identifier type="url">{http://opus.kobv.de/zib/volltexte/2005/869/}</identifier>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-8698</enrichment>
    <author>Ralf Borndörfer</author>
    <editor>Hans-Dietrich Haasis</editor>
    <author>Marika Neumann</author>
    <editor>Herbert Kopfer</editor>
    <author>Marc Pfetsch</author>
    <editor>Jörn Schönberger</editor>
    <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>
  </doc>
  <doc>
    <id>4839</id>
    <completedYear/>
    <publishedYear>2013</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>133</pageFirst>
    <pageLast>167</pageLast>
    <pageNumber/>
    <edition/>
    <issue>1</issue>
    <volume>142</volume>
    <type>article</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">The Steiner connectivity problem</title>
    <parentTitle language="eng">Mathematical Programming A</parentTitle>
    <identifier type="doi">10.1007/s10107-012-0564-5</identifier>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-11171</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Marika Karbstein</submitter>
    <author>Marika Karbstein</author>
    <author>Marc Pfetsch</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="institutes" number="traffic">Mathematics of Transportation and Logistics</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="projects" number="MATHEON-B15">MATHEON-B15</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
</export-example>
