Network flows: theory, algorithms, and applications | Guide books

Network flows: theory, algorithms, and applicationsMarch 1993

Authors:
Ravindra K. Ahuja
Indian Institute of Technology, Kanpur, India
,
Thomas L. Magnanti
Massachusetts Institute of Technology, Cambridge
,
James B. Orlin
Massachusetts Institute of Technology, Cambridge

Publisher:

Prentice-Hall, Inc.
Division of Simon and Schuster One Lake Street Upper Saddle River, NJ
United States

ISBN:978-0-13-617549-0

Published:01 March 1993

Pages:

846

Available at Amazon

Bibliometrics

Abstract

No abstract available.

Cited By

Contributors

Ravindra K Ahuja
University of Florida
- Publication Years1987 - 2018
- Publication counts55
- Citation count2,585
- Available for Download1
- Downloads (cumulative)6,461
- Downloads (12 months)663
- Downloads (6 weeks)108
- Average Downloads per Article6,461
- Average Citation per Article47
View Full Profile
Thomas L Magnanti
MIT Sloan School of Management
- Publication Years1970 - 2021
- Publication counts52
- Citation count1,889
- Available for Download1
- Downloads (cumulative)3,930
- Downloads (12 months)1,591
- Downloads (6 weeks)179
- Average Downloads per Article3,930
- Average Citation per Article36
View Full Profile
James B Orlin
Massachusetts Institute of Technology
- Publication Years1981 - 2022
- Publication counts122
- Citation count3,672
- Available for Download19
- Downloads (cumulative)18,898
- Downloads (12 months)1,794
- Downloads (6 weeks)282
- Average Downloads per Article995
- Average Citation per Article30
View Full Profile

Index Terms

Network flows: theory, algorithms, and applications
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
  2. Mathematical analysis
    1. Mathematical optimization
    2. Numerical analysis
      1. Computations on matrices
2. Theory of computation
  1. Design and analysis of algorithms
    1. Mathematical optimization
  2. Randomness, geometry and discrete structures
    1. Computational geometry

Recommendations

Augmenting anycast network flows
ICDCN '16: Proceedings of the 17th International Conference on Distributed Computing and Networking

Updating network flows in a real-world setting is a nascent research area, especially with the recent rise of Software Defined Networks. While augmenting s-t flows of a single commodity is a well-understood concept, we study updating flows in a multi-...
Read More
An Expressive Simulator for Dynamic Network Flows
IC2E '15: Proceedings of the 2015 IEEE International Conference on Cloud Engineering

Software-defined networking (SDN) increases the network programmability, promoting an effective development of networked systems of cloud scale. As the scale of the networks and systems is growing larger and larger with time, programmability of the ...
Read More
Heterogeneous Multi-commodity Network Flows over Time
Computer Science – Theory and Applications
Abstract
In the 1950’s, Ford and Fulkerson introduced dynamic flows by incorporating the notion of time into the network flow model (Oper. Res., 1958). In this paper, motivated by real-world applications including route planning and evacuations, we extend ...
Read More

Reviewer: Friedemann W. Stallmann

The concepts and techniques of network flows are among the most important areas of operations research and have found applications in all branches of science, engineering, and business. This book attempts “to capture these various perspectives and in doing so to fill a need that we perceived for a comprehensive text on network flows that would bring together the old and the new, and to provide an integrative view of theory, algorithms, and applications.” This goal is a tall order even within about 850 pages. The authors succeed by concentrating on principles and ideas and developing them in a systematic and efficient manner. Applications are not slighted—the summary lists 156 applications from many different fields that are discussed in the text. This approach, combined with the clarity of style and a pleasing layout, makes the book a joy to read. Left out—with some justification—are all the dirty details. The reader who is primarily interested in recipes will be disappointed; the book contains few, and no large, numerical examples, and no software is listed or referenced. Even such a reader will appreciate the excellent list of references at the end of each chapter, however. The first two chapters cover the general ideas and terminology of networks and graphs with some of the basic theorems and tools. A chapter on algorithms follows; here, and in the related appendices on data structures and NP-completeness, a major weakness of the book becomes apparent. Since any in-depth discussion of algorithms and computational complexity would exceed by far the scope of the text, the contents of these chapters are reduced to generalities that will become clear only after the reader studies specific examples in the subsequent chapters. A similar criticism applies to chapter 18, on the computational testing of algorithms. Again, only generalities are given, since no large-scale numerical examples are included anywhere in the text. Some plots appear but their sources are not identified, so it is hard to see their significance even if they are representative of real-world problems. The rest of the chapters deal with specific problems and the algorithms for solving them, starting from the simplest and proceeding to increasingly more complex ones. All the necessary theorems and concepts are developed from scratch, but a fair amount of mathematical maturity is expected from the reader, as is considerable effort in filling in the details. Citations of references and numerous exercises (without solutions) appear at the end of each chapter. Both are intended for the reader who wants to explore the topics further. The main text is followed by three appendices: the discussions of NP-completeness and data structures and one on linear programming. A generous and up-to-date list of references and an index conclude the text. The book is obviously intended and well suited as a text for an upper-division undergraduate or graduate course on the topic. The instructor would, however, be well advised to supply numerical examples and computer programs as exercises to make the study less academic. The book can also be used for self-study by persons seeking an introduction to the field and guidance in solving related optimization problems.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Browse Books

Sections

Cited By

Index Terms

Augmenting anycast network flows

An Expressive Simulator for Dynamic Network Flows

Heterogeneous Multi-commodity Network Flows over Time

Access critical reviews of Computing literature here

Save to Binder

Sections

Cited By

Save to Binder

Index Terms

Recommendations

Augmenting anycast network flows

An Expressive Simulator for Dynamic Network Flows

Heterogeneous Multi-commodity Network Flows over Time

Access critical reviews of Computing literature here