A generalized dynamic flows problem

DOI10.1002/NET.3230090204MaRDI QIDQ4196214zbMATH OpenOpenAlexFDO

Authors

Publication date 1979

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230090204

zbMATH Keywords

Maximal FlowNetwork ProgrammingGeneralized Dynamic Flows in Networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Cites work

• scientific article; zbMATH DE number 3504706 (Why is no real title available?)
• Maximal Flow Through a Network

Cited in

(8)

• On continuous network flows
• A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs
• Dynamic flows with time-dependent capacities
• A critical survey on the network optimization algorithms for evacuation planning problems
• Time-varying universal maximum flow problems
• A survey of dynamic network flows
• A survey on models and algorithms for discrete evacuation planning network problems
• Heterogeneous multi-commodity network flows over time

This page was built for publication: A generalized dynamic flows problem

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