Cantitate/Preț
Produs
Total produse
Vezi coșul
Network Flows: Theory, Algorithms, and Applications de Ravindra K. Ahuja

Network Flows: Theory, Algorithms, and Applications

Autor Ravindra K. Ahuja, James B. Orlin, Thomas L. Magnanti
en Limba Engleză Hardback – 31 ian 1993
Bringing together the classic and the contemporary aspects of the field, this comprehensive introduction to network flows provides an integrative view of theory, algorithms, and applications. It offers in-depth and self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including a description of new and novel polynomial-time algorithms for these core models. For professionals working with network flows, optimization, and network programming.
Citește tot Restrânge

Preț: 156920 lei

Preț vechi: 203792 lei
-23%

Puncte Express: 2354
Preț estimativ în valută:
27762€ • 32277$ • 24065£

Carte tipărită la comandă

Livrare economică 04-18 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780136175490
ISBN-10: 013617549X
Pagini: 864
Ilustrații: index
Dimensiuni: 186 x 244 x 48 mm
Greutate: 1.4 kg
Ediția:New.
Editura: Pearson
Locul publicării:Upper Saddle River, United States

Cuprins



 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.

Caracteristici

  • presents in-depth, self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including descriptions of polynomial-time algorithms for these core models.
  • emphasizes powerful algorithmic strategies and analysis tools such as data scaling, geometric improvement arguments, and potential function arguments.
  • provides an easy-to-understand descriptions of several important data structures, including d-heaps, Fibonacci heaps, and dynamic trees.
  • devotes a special chapter to conducting empirical testing of algorithms.
  • features over 150 applications of network flows to a variety of engineering, management, and scientific domains.
  • contains extensive reference notes and illustrations.

Descriere

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.