Inhalt des Dokuments
Publikationen
Zitatschlüssel | KappmeierMatuschkePeis2012 |
---|---|
Autor | Kappmeier, Jan-Philipp W. and Matuschke, Jannik and Peis, Britta |
Buchtitel | Algorithms and Computation: 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings |
Seiten | 433-443 |
Jahr | 2012 |
ISBN | 978-3-642-35260-7 |
Herausgeber | Kun-Mao Chao, Tsan-sheng Hsu, and Der-Tsai Lee |
Verlag | Springer |
Serie | Lecture Notes in Computer Science |
Zusammenfassung | Flows over time generalize classical network ows by introducing a notion of time. Each arc is equipped with a transit time that specifies how long flow takes to traverse it, while flow rates may vary over time within the given edge capacities. In this paper, we extend this concept of a dynamic optimization problem to the more general setting of abstract flows. In this model, the underlying network is replaced by an abstract system of linearly ordered sets, called "paths" satisfying a simple switching property: Whenever two paths P and Q intersect, there must be another path that is contained in the beginning of P and the end of Q. We show that a maximum abstract flow over time can be obtained by solving a weighted abstract flow problem and constructing a temporally repeated flow from its solution. In the course of the proof, we also show that the relatively modest switching property of abstract networks already captures many essential properties of classical networks. |
Vorträge
Besuch der Delegation der Polytechnischen Universität Peking Technische Universität Berlin, Deutschland, 31.10.2013 Evacuation Optimization (download) | |
COGA Doktoranden- & Diplomanden-Seminar Technische Universität Berlin, Deutschland, 21.02.2013 How to TikZ? | |
Lehrstuhl-2-Seminar Technische Universität Dortmund, Deutschland, 29.01.2013 Generalizations of Flows over Time and a Fake Application |
International Symposium on Algorithms and Computation National Taiwan University, 台北市 Taipeh, 20.12.2012 Abstract Flows over Time: A First Step towards Solving Dynamic Packing Problems | |
Berlin-Poznań-Seminar Freie Universität Berlin, Deutschland, 10.11.2012 Abstract Flows over Time | |
International Symposium on Mathematical Programming Technische Universität Berlin, Deutschland, 23.08.2012 Flows over Time with Negative Transit Times and Arc Release Dates | |
International Conference on Evacuation Modeling and Management Northwestern University, Evanston, USA, 15.08.2012 Evacuation of a 22-Story Building in Simulation and Reality | |
Cologne Twente Workshop on Graphs and combinatorial Optimization Universität der Bundeswehr, München, Deutschland, 30.05.2012 Network Flows over Time with Negative Transit Times and Arc Release Dates. | |
Tools Seminar Technische Universität Berlin, Deutschland, 09.02.2012 How to TikZ? |
COGA Doktoranden- & Diplomanden-Seminar Technische Universität Berlin, Deutschland, 07.12.2010 How to TikZ? (aktualisiert 13.12.2010) |
International Conference on Evacuation Management 2009 Scheveningen, Niederlande, 24.09.2009 On the Use Network Flow Techniques for Assigning Evacuees to Exits |
Zusatzinformationen / Extras
Direktzugang
Schnellnavigation zur Seite über Nummerneingabe
Hilfsfunktionen
Diese Seite verwendet Matomo für anonymisierte Webanalysen. Mehr Informationen und Opt-Out-Möglichkeiten unter Datenschutz.