Time-varying universal maximum flow problems

DOI10.1016/S0895-7177(00)00252-1zbMath0987.90083OpenAlexW2004775670MaRDI QIDQ5936757

No author found.

Publication date: 8 July 2001

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0895-7177(00)00252-1

zbMATH Keywords

dynamic flow problemuniversal flow

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Transient flows in networks
• Maximal Flow Through a Network
• Maximal, Lexicographic, and Dynamic Network Flows
• A generalized dynamic flows problem
• An Algorithm for Universal Maximal Dynamic Flows in a Network

This page was built for publication: Time-varying universal maximum flow problems