License
when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-6827
URL:

;

QoS-aware Multicommodity Flows and Transportation Planning

pdf-format:


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:OASIcs:2006:682,
  author =	{George Tsaggouris and Christos Zaroliagis},
  title =	{{QoS-aware Multicommodity Flows and Transportation Planning}},
  booktitle =	{6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06)},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-01-9},
  ISSN =	{2190-6807},
  year =	{2006},
  volume =	{5},
  editor =	{Riko Jacob and Matthias M{\"u}ller-Hannemann},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2006/682},
  URN =		{urn:nbn:de:0030-drops-6827},
  doi =		{http://dx.doi.org/10.4230/OASIcs.ATMOS.2006.682},
  annote =	{Keywords: Quality of service, multicommodity flows, fully polynomial approximation scheme, transportation planning}
}

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: 2006


DROPS-Home | Fulltext Search | Imprint Published by LZI