This book presents the important techniques, both recent and traditional, related to network flow programming. The authors have three objectives: to emphasize concepts rather than proofs; to include a
coherent, computational package of efficient algorithms for solving any problem addressed in the book; and to present the relationships between linear programming and network flow programming and the interrelationships
between their suggested techniques solutions. The book is suitable for the first-year graduate or advanced undergraduate in computer science, engineering, operations research, applied mathematics, and business
administration, with the largest audience being the practitioner.