SØG - mellem flere end 8 millioner bøger:
Viser: Network Flows - Pearson New International Edition
Network Flows
Pearson New International Edition
Ravindra Ahuja, Thomas Magnanti og James Orlin
(2013)
Sprog: Engelsk
Pearson Education, Limited
888,00 kr.
799,20 kr.
3 stk på lager
Hvor kan jeg afhente varen?Detaljer om varen
- Paperback: 864 sider
- Udgiver: Pearson Education, Limited (November 2013)
- Forfattere: Ravindra Ahuja, Thomas Magnanti og James Orlin
- ISBN: 9781292042701
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.
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.
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.
De oplyste priser er inkl. moms
Andre har også købt:
Integer Programming
Af Laurence A. Wols...
Af Laurence A. Wols...
Pris: 699,00 .kr
Rabatpris: 629,10 kr.
Rabatpris: 629,10 kr.
Deep Learning
Af Ian Goodfellow, ...
Af Ian Goodfellow, ...
Pris: 1.149,00 .kr
Rabatpris: 1.034,10 kr.
Rabatpris: 1.034,10 kr.
Sustainable Operation...
Af Melanie E. Kreye...
Af Melanie E. Kreye...
Pris: 444,00 .kr
Rabatpris: 399,60 kr.
Rabatpris: 399,60 kr.
Modern Computer Algeb...
Af Joachim von zur ...
Af Joachim von zur ...
Pris: 1.299,00 .kr
Rabatpris: 1.169,10 kr.
Rabatpris: 1.169,10 kr.
Butikker og åbningstid
Handler du som firma
Forretningsbetingelser
Porto og forsendelse
Data & cookiepolitik
Handler du som firma
Forretningsbetingelser
Porto og forsendelse
Data & cookiepolitik
Find pensumliste
FAQ for studerende
Pensumlistegaranti
Sortiment og levering
Kompendier(for undervisere)
FAQ for studerende
Pensumlistegaranti
Sortiment og levering
Kompendier(for undervisere)
Polyteknisk Boghandel og Forlag A/S - Anker Engelundsvej 1 - 2800 Lyngby
Tlf 77 42 43 44 - email poly@polyteknisk.dk - CVR 34072655 - Sydbank Reg: 6748 Konto 0001107927
Tlf 77 42 43 44 - email poly@polyteknisk.dk - CVR 34072655 - Sydbank Reg: 6748 Konto 0001107927