Earliest arrival flows on series-parallel graphs

DOI10.1002/NET.20398MaRDI QIDQ3082606zbMATH OpenOpenAlexFDO

Authors Stefan Ruzika, Mechthild Steiner, Heike Sperber

Publication date 16 March 2011

Published in Networks (Search for Journal in Brave)

Full work available at URL http://kluedo.ub.uni-kl.de/frontdoor/index/index/docId/2137

zbMATH Keywords

discrete time settingdynamic network flowsearliest arrival flowspolynomial algorithmsseries-parallel graphsuniversally maximal dynamic flows

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Queues and service in operations research (90B22)

Recommendations

• Earliest Arrival Flows with Multiple Sources
• A heuristic algorithm for the earliest arrival flow with multiple sources
• Approximating Earliest Arrival Flows in Arbitrary Networks
• Earliest arrival flows in networks with multiple sinks
• Earliest arrival flows in networks with multiple sinks

Cites work

• An Algorithm for Universal Maximal Dynamic Flows in a Network
• Maximal, Lexicographic, and Dynamic Network Flows
• Minimum cost flow algorithms for series-parallel networks
• Minimum-cost dynamic flows: The series-parallel case
• Multicommodity flows over time: Efficient algorithms and complexity
• Network flows. Theory, algorithms, and applications.
• Quickest Flows Over Time
• The Recognition of Series Parallel Digraphs
• Transient flows in networks

Cited in

(17)

• Complexity of strict robust integer minimum cost flow problems: an overview and further results
• Continuous time dynamic contraflow models and algorithms
• Cross-series-parallel digraphs
• Network flow with intermediate storage: models and algorithms
• Evacuation planning by earliest arrival contraflow
• Continuous dynamic contraflow approach for evacuation planning
• A survey on models and algorithms for discrete evacuation planning network problems
• Dynamic network flow location models and algorithms for quickest evacuation planning
• Approximating Earliest Arrival Flows in Arbitrary Networks
• Earliest Arrival Flows with Multiple Sources
• Risk models for the prize collecting Steiner tree problems with interval data
• Maximum contraflow evacuation planning problems on multi-network
• A critical survey on the network optimization algorithms for evacuation planning problems
• Minimum-peak-cost flows over time
• Temporally repeated maximum dynamic flow with intermediate storage
• Network restructuring for dynamic flow improvement
• Maximum dynamic FlowLoc with intermediate storage: a temporally repeated approach

This page was built for publication: Earliest arrival flows on series-parallel graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3082606)