Network Flows 1E : Theory, Algorithms, and Applications  - Ahuja, Ravindra K.

Network Flows 1E : Theory, Algorithms, and Applications

Ravindra K. Ahuja

Yayınevi: Pearson Education

Yayın tarihi: 10/1993

ISBN: 9780136175490

Yazar : THOMAS L. MAGNANTI JAMES B. ORLIN

Ciltli | İngilizce | 1350 Sayfa | Büyük boy  |  235 mm x 178 mm

Tür: Bilgisayar-Akademik

  • Temin Süresi 10 - 45 iş günü

  • ÜYE GİRİŞİ YAPIN

    temin süresi ve fiyatını size bildirelim

  • ÜYE GİRİŞİ YAPIN

    stoklarımıza girdiğinde bilgilendirelim

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. Contents:

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.

İlgili Ürünler

Bu Türde Çok Satanlar

Kredi Kartına Taksit İmkanı
  • 3 Taksit

  • 3 Taksit

  • 3 Taksit

©1996-2019 Pandora Yayın ve Kitap Hizmetleri A.Ş.

Mersis No: 0721-0430-4310-0015

Tasarım : Logo Site Tasarımı