Contains a synthesis of the more important techniques, both recent and traditional related to network flow programming. Emphasis concepts rather than proofs and presents a complete exposition of the total spectrum of single commodity network flow programming problems, ranging from such basic topics as network storage techniques and handling representations to such advanced topics as stochastic and generalized networks. Provides an estensive bibliography to the literature which presents theoretical underpinnings of the subject.