Picture 1 of 3
Stock photo
Picture 1 of 3
Stock photo
Network Flows : Theory, Algorithms, and Applications by Ravindra Ahuja, Thomas Magnanti and James Orlin (1993, Hardcover)
N
NewBoxSetBooks (461)
98.3% positive feedback
Price:
US $32.85
ApproximatelyRM 140.54
+ $23.20 shipping
Returns:
30 days return. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Condition:
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
About this product
Product Identifiers
PublisherPearson Education
ISBN-10013617549X
ISBN-139780136175490
eBay Product ID (ePID)25038248894
Product Key Features
Number of Pages864 Pages
Publication NameNetwork Flows : Theory, Algorithms, and Applications
LanguageEnglish
Publication Year1993
SubjectNetworking / General, Telecommunications
TypeTextbook
AuthorRavindra Ahuja, Thomas Magnanti, James Orlin
Subject AreaComputers, Technology & Engineering
FormatHardcover
Dimensions
Item Height2 in
Item Weight54.4 Oz
Item Length9.3 in
Item Width7.4 in
Additional Product Features
Edition Number1
Intended AudienceCollege Audience
LCCN92-026702
Dewey Edition20
IllustratedYes
Dewey Decimal658.4/032
Table Of Content1. 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.
SynopsisBringing 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., 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., 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. KEY TOPICS: 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. MARKET: For professionals working with network flows, optimization, and network programming., 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. 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.
LC Classification NumberT57.85 .A37 1993
Be the first to write a review
