Network flows : theory, algorithms, and applications / Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin.
Language: İngilizce Publisher: Upper Saddle River, N.J. : Prentice Hall, c1993Description: xv, 846 p. : ill. ; 25 cmISBN:- 013617549X
- TK57.85 .A37 1993
| Item type | Current library | Home library | Collection | Call number | Vol info | Copy number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|---|---|---|
Book
|
Merkez Kütüphane Genel Koleksiyon / Main Collection | Merkez Kütüphane | Genel Koleksiyon | TK57.85 .A37 1993 (Browse shelf(Opens below)) | 1 | 1 | Available | 0002124 |
Browsing Merkez Kütüphane shelves, Shelving location: Genel Koleksiyon / Main Collection, Collection: Genel Koleksiyon Close shelf browser (Hides shelf browser)
| No cover image available | No cover image available | No cover image available | ||||||
| TJ 1350 .S619 1984 Götürücüler (konveyörler) ve ilgili donatımı / | TJ1370 .M35 2010 Asansörlerde durum raporu : uygulamalar ve yapılması gerekenler / | TK Bilgisayar montajı ve satın alma rehberi PC NET BİLGİSAYAR VE İNTERNET DERGİSİ ÖZEL KOLEKSİYON 2009 | TK57.85 .A37 1993 Network flows : | TK113.T8 C86 2023 Cumhuriyetin 100. yılında Türkiye elektrik tarihi / | TK140.T4 C4619 2010 Zamanın ötesindeki deha TESLA / | TK140.T4 I519 2018 Tesla: icatlarım ve hayatım / |
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: [actual symbol not reproducible]-Completeness -- Appendix C: Linear Programming.
There are no comments on this title.
