Minimum Cost Flows Over Time without Intermediate Storage
| dc.contributor.author | Fleischer, Lisa | |
| dc.contributor.author | Skutella, Martin | |
| dc.date.accessioned | 2021-12-17T10:05:08Z | |
| dc.date.available | 2021-12-17T10:05:08Z | |
| dc.date.issued | 2002 | |
| dc.description.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. | en |
| dc.identifier.issn | 2197-8085 | |
| dc.identifier.uri | https://depositonce.tu-berlin.de/handle/11303/15453 | |
| dc.identifier.uri | http://dx.doi.org/10.14279/depositonce-14226 | |
| dc.language.iso | en | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
| dc.subject.ddc | 510 Mathematik | en |
| dc.subject.other | approximation algorithms | en |
| dc.subject.other | dynamic flow | en |
| dc.subject.other | flow over time | en |
| dc.subject.other | graph algorithms | en |
| dc.subject.other | network flow | en |
| dc.subject.other | routing | en |
| dc.title | Minimum Cost Flows Over Time without Intermediate Storage | en |
| dc.type | Research Paper | en |
| dc.type.version | submittedVersion | en |
| tub.accessrights.dnb | free | en |
| tub.affiliation | Fak. 2 Mathematik und Naturwissenschaften::Inst. Mathematik | de |
| tub.affiliation.faculty | Fak. 2 Mathematik und Naturwissenschaften | de |
| tub.affiliation.institute | Inst. Mathematik | de |
| tub.publisher.universityorinstitution | Technische Universität Berlin | en |
| tub.series.issuenumber | 2002, 757 | en |
| tub.series.name | Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin | en |
| tub.subject.msc2000 | 90C27 Combinatorial optimization | en |
| tub.subject.msc2000 | 90B10 Network models, deterministic | en |
| tub.subject.msc2000 | 90C35 Programming involving graphs or networks | en |
| tub.subject.msc2000 | 05C38 Paths and cycles | en |
| tub.subject.msc2000 | 05C85 Graph algorithms | en |
| tub.subject.msc2000 | 90C59 Approximation methods and heuristics | en |
| tub.subject.msc2000 | 68W25 Approximation algorithms | en |
| tub.subject.msc2000 | 68Q25 Analysis of algorithms and problem complexity | en |