<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <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>
</export-example>
