Network Flows: Theory, Algorithms, and Applications
(Sprache: Englisch)
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...
Leider schon ausverkauft
versandkostenfrei
Buch
120.86 €
60 DeutschlandCard Punkte
sammeln
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenlose Rücksendung
- Ratenzahlung möglich
Produktdetails
Produktinformationen zu „Network Flows: Theory, Algorithms, and Applications “
Klappentext zu „Network Flows: Theory, Algorithms, and Applications “
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.
Inhaltsverzeichnis zu „Network Flows: 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.
Bibliographische Angaben
- Autoren: Ravindra K. Ahuja , James B. Orlin , Thomas L. Magnanti
- 1993, 864 Seiten, Maße: 18,6 x 24,4 cm, Gebunden, Englisch
- Verlag: Prentice Hall
- ISBN-10: 013617549X
- ISBN-13: 9780136175490
Sprache:
Englisch
Kommentar zu "Network Flows: Theory, Algorithms, and Applications"
0 Gebrauchte Artikel zu „Network Flows: Theory, Algorithms, and Applications“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Network Flows: Theory, Algorithms, and Applications".
Kommentar verfassen