<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>6974</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>2018-07-31</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Separation of Cycle Inequalities in Periodic Timetabling</title>
    <abstract language="eng">Cycle inequalities play an important role in the polyhedral study of the periodic&#13;
timetabling problem. We give the first pseudo-polynomial time separation algo-&#13;
rithm for cycle inequalities, and we give a rigorous proof for the pseudo-polynomial&#13;
time separability of the change-cycle inequalities. Moreover, we provide several&#13;
NP-completeness results, indicating that pseudo-polynomial time is best possible.&#13;
The efficiency of these cutting planes is demonstrated on real-world instances of the&#13;
periodic timetabling problem.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-69746</identifier>
    <identifier type="doi">https://doi.org/10.1016/j.disopt.2019.100552</identifier>
    <enrichment key="SubmissionStatus">accepted for publication</enrichment>
    <enrichment key="AcceptedDate">2019/08/13</enrichment>
    <enrichment key="SourceTitle">Discrete Optimization</enrichment>
    <author>Ralf Borndörfer</author>
    <submitter>Niels Lindner</submitter>
    <author>Heide Hoppmann</author>
    <author>Marika Karbstein</author>
    <author>Niels Lindner</author>
    <series>
      <title>ZIB-Report</title>
      <number>18-16</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Periodic timetabling</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Cycle inequality</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Change-cycle inequality</value>
    </subject>
    <collection role="ccs" number="G.">Mathematics of Computing</collection>
    <collection role="ccs" number="J.">Computer Applications</collection>
    <collection role="msc" number="90-XX">OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="persons" number="borndoerfer">Borndörfer, Ralf</collection>
    <collection role="projects" number="MODAL-RailLab">MODAL-RailLab</collection>
    <collection role="projects" number="MODAL-Gesamt">MODAL-Gesamt</collection>
    <collection role="persons" number="lindner">Lindner, Niels</collection>
    <collection role="projects" number="ECMath-MI7">ECMath-MI7</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/6974/sepa_cycle.pdf</file>
  </doc>
</export-example>
