License
when quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ATMOS.2006.682
URN: urn:nbn:de:0030-drops-6827
URL: http://drops.dagstuhl.de/opus/volltexte/2006/682/
Tsaggouris, George ; Zaroliagis, Christos

QoS-aware Multicommodity Flows and Transportation Planning

pdf-format:
Dokument 1.pdf (277 KB)

Abstract

We consider the emph{QoS-aware Multicommodity Flow} problem, a natural generalization of the weighted multicommodity flow problem where the demands and commodity values are elastic to the Quality-of-Service characteristics of the underlying network. The problem is fundamental in transportation planning and also has important applications beyond the transportation domain. We provide a FPTAS for the QoS-aware Multicommodity Flow problem by building upon a Lagrangian relaxation method and a recent FPTAS for the non-additive shortest path problem.

BibTeX - Entry

@InProceedings{tsaggouris_et_al:DSP:2006:682,
  author =	{George Tsaggouris and Christos Zaroliagis},
  title =	{QoS-aware Multicommodity Flows and Transportation Planning},
  booktitle =	{ATMOS 2006 - 6th Workshop on Algorithmic Methods and Models for Optimization of Railways},
  year =	{2006},
  editor =	{Riko Jacob and Matthias M{\"u}ller-Hannemann},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2006/682},
  annote =	{Keywords: Quality of service, multicommodity flows, fully polynomial approximation scheme, transportation planning},
  ISBN =	{978-3-939897-01-9}
}

Keywords: Quality of service, multicommodity flows, fully polynomial approximation scheme, transportation planning
Seminar: 6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06)
Issue date: 2006
Date of publication: 29.08.2006

DROPS-Home | Fulltext Search | Imprint Published by LZI