<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-22T13:27:01Z</responseDate>
  <request identifier="4245" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:4245</identifier>
        <datestamp>2024-03-06T10:29:20Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>A Configuration Model for the Line Planning Problem</dc:title>
          <dc:creator>Borndörfer, Ralf</dc:creator>
          <dc:creator>Hoppmann, Heide</dc:creator>
          <dc:creator>Karbstein, Marika</dc:creator>
          <dc:subject>Combinatorial optimization</dc:subject>
          <dc:subject>polyhedral combinatorics</dc:subject>
          <dc:subject>line planning</dc:subject>
          <dc:description>We propose a novel extended formulation for the line planning&#13;
problem in public transport. It is based on a new concept of&#13;
frequency configurations that account for all possible&#13;
options to provide a required transportation capacity on an&#13;
infrastructure edge.  We show that this model yields a strong LP&#13;
relaxation. It implies, in particular, general classes of facet&#13;
defining inequalities for the standard model.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Ralf Borndörfer and Heide Hoppmann and Marika Karbstein</dc:contributor>
          <dc:date>2013</dc:date>
          <dc:relation>Is Part Of OASIcs, Volume 33, 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (2013)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/OASIcs.ATMOS.2013.68</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-42451</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2013.68</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
