Flows over time with load-dependent transit times
| dc.contributor.author | Köhler, Ekkehard | |
| dc.contributor.author | Skutella, Martin | |
| dc.date.accessioned | 2021-12-17T10:18:42Z | |
| dc.date.available | 2021-12-17T10:18:42Z | |
| dc.date.issued | 2001 | |
| dc.description.abstract | Flow variation over time is an important feature in network flow problems arising in various applications such as road or air traffic control, production systems, communication networks (e.g., the Internet), and financial flows. Another crucial phenomenon in many of those applications is that the time taken to traverse an edge varies with the current amount of flow on this edge. Since it is already a highly nontrivial problem to map these two aspects into an appropriate and tractable mathematical network flow model, there are hardly any algorithmic techniques known which are capable of providing reasonable solutions even for networks of rather modest size. | en |
| dc.identifier.issn | 2197-8085 | |
| dc.identifier.uri | https://depositonce.tu-berlin.de/handle/11303/15977 | |
| dc.identifier.uri | http://dx.doi.org/10.14279/depositonce-14750 | |
| 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.subject.other | traffic models | en |
| dc.title | Flows over time with load-dependent transit times | 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 | 2001, 712 | 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 | 90B20 Traffic problems | en |
| tub.subject.msc2000 | 90B10 Network models, deterministic | en |
| tub.subject.msc2000 | 90C35 Programming involving graphs or networks | en |
| tub.subject.msc2000 | 90C25 Convex programming | 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 |