Min/Max Bounds for Dynamic Network Flows,
Abstract
The paper presents an algorithm for determining the upper and lower bounds for arc flows in a maximal dynamic flow solution. The procedure is basically an extended application of the Ford-Fulkerson dynamic flow algorithm which also solves the minimal cost flow problem. A simple example is included. The presence of bounded optimal arc flows entertains the notion that one can pick a particular solution which is preferable by secondary criteria. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jul 30, 1971
- Accession Number
- AD0731694
Entities
People
- W. L. Wilkinson
Organizations
- George Washington University