Network Flows

Pearson New International Edition

Ravindra Ahuja, Thomas Magnanti, James Orlin (Autoren)

Buch | Softcover

864 Seiten

2013
Pearson Education Limited (Verlag)
978-1-292-04270-1 (ISBN)

Artikel merken

A comprehensive introduction to network flows that brings together the classic and the contemporary aspects of the field, and provides an integrative view of theory, algorithms, and applications.

1. Introduction.

2. Paths, Trees and Cycles.

3. Algorithm Design and Analysis.

4. Shortest Paths: Label Setting Algorithms.

5. Shortest Paths: Label Correcting Algorithms.

6. Maximum Flows: Basic Ideas.

7. Maximum Flows: Polynomial Algorithms.

8. Maximum Flows: Additional Topics.

9. Minimum Cost Flows: Basic Algorithms.

10. Minimum Cost Flows: Polynomial Algorithms.

11. Minimum Cost Flows: Network Simplex Algorithms.

12. Assignments and Matchings.

13. Minimum Spanning Trees.

14. Convex Cost Flows.

15. Generalized Flows.

16. Lagrangian Relaxation and Network Optimization.

17. Multicommodity Flows.

18. Computational Testing of Algorithms.

19. Additional Applications.

Appendix A: Data Structures.

Appendix B: NP-Completeness.

Appendix C: Linear Programming.

Index.

Erscheint lt. Verlag	8.11.2013
Verlagsort	Harlow
Sprache	englisch
Maße	178 x 234 mm
Gewicht	1460 g
Themenwelt	Mathematik / Informatik ► Informatik ► Netzwerke
	Informatik ► Theorie / Studium ► Algorithmen
	Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik
	Technik ► Nachrichtentechnik
ISBN-10	1-292-04270-2 / 1292042702
ISBN-13	978-1-292-04270-1 / 9781292042701
Zustand	Neuware