A survey of dynamic network flows

Dynamic network flow models describe network-structured, decision-making problems over time. They are of interest because of their numerous applications and intriguing dynamic structure. The dynamic models are specially structured problems that can be solved with known general methods. However, specialized techniques have been developed to exploit the underlying dynamic structure. Here, we present a state-of-the-art survey of the results, applications, algorithms and implementations for dynamic network flows.Presented at the XII International Symposium on Mathematical Programming, Cambridge, Massachusetts, August 1985.Prepared under National Science Foundation Grant ECS-8307549. Reproduction in whole or in part is permitted for any purpose of the United States Government. This document has been approved for public release and sale; its distribution is unlimited.