Earliest arrival flows in networks with multiple sinks
type: Item
instance of: scholarly article
title: Earliest arrival flows in networks with multiple sinks
zbMATH Open document ID: 1326.90014
author: Melanie Schmidt
author: Martin Skutella
published in: Discrete Applied Mathematics
publication date: 2015-09-22T00:00:00Z
Mathematics Subject Classification ID: 90B15
Mathematics Subject Classification ID: 76N25
zbMATH DE Number: 6484205
zbMATH Keywords: earliest arrival flow
zbMATH Keywords: flow over time
zbMATH Keywords: evacuation problem
MaRDI profile type: Publication
full work available at URL: j.dam.2011.09.023
OpenAlex ID: W2178582903
cites work: Approximating earliest arrival flows with flow-dependent transit times
cites work: Earliest Arrival Flows with Multiple Sources
cites work: The quickest flow problem
cites work: Faster algorithms for the quickest transshipment problem
cites work: Quickest Flows Over Time
cites work: Efficient continuous-time dynamic network flow algorithms
cites work: Constructing Maximal Dynamic Flows from Static Flows
cites work: Transient flows in networks
cites work: Optimal dynamic routing in communication networks with continuous traffic
cites work: The quickest transshipment problem
cites work: Q3128904
cites work: Maximal, Lexicographic, and Dynamic Network Flows
cites work: Continuous-Time Flows in Networks
cites work: An Introduction to Network Flows over Time
cites work: An Algorithm for Universal Maximal Dynamic Flows in a Network
DOI: 10.1016/J.DAM.2011.09.023
description: scientific article; zbMATH DE number 6484205