A polynomial time algorithm for the minimum flow problem in time-varying networks
type: Item
instance of: scholarly article
title: A polynomial time algorithm for the minimum flow problem in time-varying networks
zbMATH Open document ID: 1411.90067
published in: Annals of Operations Research
publication date: 2019-03-06T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7032635
zbMATH Keywords: network flows
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: (dynamic) minimum flow
zbMATH Keywords: (dynamic) preflow-pull algorithm
author: Salman Khodayifar
author: M. A. Raayatpanah
author: Panos M. Pardalos
MaRDI profile type: Publication
full work available at URL: s10479-017-2450-2
OpenAlex ID: W2593184009
cites work: Q3056948
cites work: A survey of dynamic network flows
cites work: Time-varying minimum cost flow problems
cites work: Sequential and parallel algorithms for minimum flows.
cites work: Minimum flow problem on network flows with time-varying bounds
cites work: Quickest Flows Over Time
cites work: Efficient continuous-time dynamic network flow algorithms
cites work: Q5426803
cites work: Constructing Maximal Dynamic Flows from Static Flows
cites work: A Fast Parametric Maximum Flow Algorithm and Applications
cites work: A note on the parametric maximum flow problem and some related reoptimization issues
cites work: Q4449191
cites work: Q3274170
cites work: Minimum-cost dynamic flows: The series-parallel case
cites work: Flows over time in time-varying networks: optimality conditions and strong duality
cites work: Continuous and discrete flows over time
cites work: Multicriteria adaptive paths in stochastic, time-varying networks
cites work: Max flows in O(nm) time, or better
cites work: Q5687194
cites work: An Introduction to Network Flows over Time
DOI: 10.1007/S10479-017-2450-2
description: scientific article; zbMATH DE number 7032635