Cantitate/Preț
Produs
Total produse
Vezi coșul
Orlin, J: Network Flows de James Orlin

Orlin, J: Network Flows

Autor James Orlin
en Limba Engleză Paperback – 8 noi 2013
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.
Citește tot Restrânge

Preț: 62923 lei

Preț vechi: 74026 lei
-15%

Puncte Express: 944
Preț estimativ în valută:
11124€ • 13263$ • 9648£

Carte disponibilă

Livrare economică 23 februarie-09 martie
Livrare express 06-12 februarie pentru 6671 lei

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9781292042701
ISBN-10: 1292042702
Pagini: 864
Dimensiuni: 178 x 236 x 47 mm
Greutate: 1.47 kg
Ediția:Pearson New International Edition
Editura: Pearson Education

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.