<?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-20T05:27:10Z</responseDate>
  <request identifier="2146" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:2146</identifier>
        <datestamp>2024-03-06T10:28:40Z</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>On Assessing Robustness in Transportation Planning</dc:title>
          <dc:creator>Bessas, Apostolos</dc:creator>
          <dc:creator>Zaroliagis, Christos</dc:creator>
          <dc:subject>QoS-ware Multicommodity Flow</dc:subject>
          <dc:subject>Robust Planning</dc:subject>
          <dc:subject>Demand Elasticity</dc:subject>
          <dc:subject>Packing LP QoS-ware Multicommodity Flow</dc:subject>
          <dc:subject>Robust Planning</dc:subject>
          <dc:subject>Demand Elasticity</dc:subject>
          <dc:subject>Packing LP</dc:subject>
          <dc:description>We consider a fundamental problem, called \emph{QoS-aware Multicommodity Flow},&#13;
for assessing robustness in transportation planning. It constitutes a&#13;
natural generalization of the weighted multicommodity flow problem, where&#13;
the demands and commodity values are elastic to the Quality-of-Service (QoS)&#13;
characteristics of the underlying network. The problem is also fundamental in&#13;
other domains beyond transportation planning. In this work, we provide an&#13;
extensive experimental study of two FPTAS for the QoS-aware Multicommodity&#13;
Flow Problem enhanced with several heuristics, and show the superiority of&#13;
a new heuristic we introduce here.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Apostolos Bessas and Christos Zaroliagis</dc:contributor>
          <dc:date>2009</dc:date>
          <dc:relation>Is Part Of OASIcs, Volume 12, 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09) (2009)</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.2009.2146</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-21469</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2009.2146</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
