THREE GENERAL NETWORK FLOW PROBLEMS AND THEIR SOLUTIONS
Abstract
Computational procedures for solving three general network flow problems are presented, together with proofs establishing their validity. Two of the problems are concerned with the determination of feasible flows (i.e., flows that lie between prescribed bounds in every arc of the network) whose costs are minimum, where arc costs are proportional to the magnitude of arc flow. The third problem involves the determination of whether or not a given feasible flow has minimum cost. The utility of the three procedures is illustrated in the context of a general transportation application. The material presented constitutes an adaptation and unified discussion of various known concepts and results in network flow theory.
Document Details
- Document Type
- Technical Report
- Publication Date
- Nov 01, 1962
- Accession Number
- AD0296365
Entities
People
- Paul J. Gowen
- Robert G. Busacker
- Stephen A. Coffin