Earliest arrival flows on series-parallel graphs

DOI10.1002/net.20398zbMath1207.90041OpenAlexW1907168435MaRDI QIDQ3082606

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

polynomial algorithmsdiscrete time settingseries-parallel graphsdynamic network flowsearliest arrival flowsuniversally maximal dynamic flows

Mathematics Subject Classification ID

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

Related Items (11)

Evacuation planning by earliest arrival contraflow ⋮ Continuous dynamic contraflow approach for evacuation planning ⋮ Dynamic network flow location models and algorithms for quickest evacuation planning ⋮ Risk models for the prize collecting Steiner tree problems with interval data ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Complexity of strict robust integer minimum cost flow problems: an overview and further results ⋮ Network flow with intermediate storage: models and algorithms ⋮ Cross-series-parallel digraphs ⋮ Continuous time dynamic contraflow models and algorithms ⋮ A survey on models and algorithms for discrete evacuation planning network problems

Cites Work

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

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