Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14226
For citation please use:
Main Title: Minimum Cost Flows Over Time without Intermediate Storage
Author(s): Fleischer, Lisa
Skutella, Martin
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15453
http://dx.doi.org/10.14279/depositonce-14226
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: Flows over time (also called dynamic flows) generalize standard network flows by introducing an element of time. They naturally model problems where travel and transmission are not instantaneous. Solving these problems raises issues that do not arise in standard network flows. One issue is the question of storage of flow at intermediate nodes. In most applications (such as, e.g., traffic routing, evacuation planning, telecommunications etc.), intermediate storage is limited, undesired, or prohibited.
Subject(s): approximation algorithms
dynamic flow
flow over time
graph algorithms
network flow
routing
Issue Date: 2002
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
MSC 2000: 90C27 Combinatorial optimization
90B10 Network models, deterministic
90C35 Programming involving graphs or networks
05C38 Paths and cycles
05C85 Graph algorithms
90C59 Approximation methods and heuristics
68W25 Approximation algorithms
68Q25 Analysis of algorithms and problem complexity
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2002, 757
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Report-757-2002.pdf
Format: Adobe PDF | Size: 177.61 kB
DownloadShow Preview
Thumbnail
Report-757-2002.ps.gz
Format: Unknown | Size: 131.06 kB
Download

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.