OASIcs.ATMOS.2006.682.pdf
- Filesize: 277 kB
- 14 pages
Document
QoS-aware Multicommodity Flows and Transportation Planning
Authors
-
Part of:
Volume:
6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06) (ATMOS 2006)
Series: Open Access Series in Informatics (OASIcs)
Conference: Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2006-08-29
Cite AsGet BibTex
George Tsaggouris and Christos Zaroliagis. QoS-aware Multicommodity Flows and Transportation Planning. In 6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06). Open Access Series in Informatics (OASIcs), Volume 5, pp. 1-14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
https://doi.org/10.4230/OASIcs.ATMOS.2006.682
https://doi.org/10.4230/OASIcs.ATMOS.2006.682
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.
Keywords
- Quality of service
- multicommodity flows
- fully polynomial approximation scheme
- transportation planning
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads