|
|
Sold Out
Book Categories |
| Preface | ||
| 1 | Introduction | 1 |
| 2 | Paths, Trees, and Cycles | 23 |
| 3 | Algorithm Design and Analysis | 53 |
| 4 | Shortest Paths: Label-Setting Algorithms | 93 |
| 5 | Shortest Paths: Label-Correcting Algorithms | 133 |
| 6 | Maximum Flows: Basic Ideas | 166 |
| 7 | Maximum Flows: Polynomial Algorithms | 207 |
| 8 | Maximum Flows: Additional Topics | 250 |
| 9 | Minimum Cost Flows: Basic Algorithms | 294 |
| 10 | Minimum Cost Flows: Polynomial Algorithms | 357 |
| 11 | Minimum Cost Flows: Network Simplex Algorithms | 402 |
| 12 | Assignments and Matchings | 461 |
| 13 | Minimum Spanning Trees | 510 |
| 14 | Convex Cost Flows | 543 |
| 15 | Generalized Flows | 566 |
| 16 | Lagrangian Relaxation and Network Optimization | 598 |
| 17 | Multicommodity Flows | 649 |
| 18 | Computational Testing of Algorithms | 695 |
| 19 | Additional Applications | 717 |
| Appendix A: Data Structures | 765 | |
| Appendix B: [actual symbol not reproducible]-Completeness | 788 | |
| Appendix C: Linear Programming | 802 | |
| References | 821 | |
| Index | 840 |
| Price | Condition | Delivery | Seller | Action |
| $142.44 | Digital |
| WonderClub |
Ron Mencel
reviewed Network Flows: Theory, Algorithms, and Applications on August 09, 2011
Network Flows
This book was the basis of one of my comprehensive exams for a PhD program. There is much emphasis on implementation: lots of discussion of data structures, etc. In my case we didn't need to know about data structures but did need all the algorithms, which the book does a good job of laying out, explaining, demonstrating. Can be long-winded, making it a little painful to read cover to cover.
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish List
X
This item is in your Collection
Network Flows: Theory, Algorithms, and Applications
X
This Item is in Your Inventory
Network Flows: Theory, Algorithms, and Applications
X
You must be logged in to review the productsX
X
X
Add 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 p, Network Flows: Theory, Algorithms, and Applications to the inventory that you are selling on WonderClubX
X
Add 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 p, Network Flows: Theory, Algorithms, and Applications to your collection on WonderClub |
