Network Flows

Viser: Network Flows - Pearson New International Edition

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?

Bestil nu og få den leveret inden for 2-3 hverdage

Porto kan blive tilføjet, se takster her

Du kan vælge at få vare sendt eller afhente den i en af vores butikker. Vælger du at få den sendt koster det:

Levering på adressen
1 - 1 vare – kr.	59.5
2 - 5 varer – kr.	59.5
6 - 10 varer – kr.	59.5
11 - 20 varer – kr.	59.5
21 - 49 varer – kr.	79.5
50 - 9999 varer – kr.	119.5

Levering på firma adressen
1 - 1 vare – kr.	39.5
2 - 5 varer – kr.	39.5
6 - 10 varer – kr.	39.5
11 - 20 varer – kr.	39.5
21 - 49 varer – kr.	79.5
50 - 9999 varer – kr.	119.5

Afhent i postbutik eller pakkeboks
1 - 1 vare – kr.	39.5
2 - 5 varer – kr.	39.5
6 - 10 varer – kr.	39.5
11 - 20 varer – kr.	39.5
21 - 49 varer – kr.	59.5
50 - 9999 varer – kr.	99.5

Læs mere om forsendelse her

Detaljer om varen

Paperback: 864 sider
Udgiver: Pearson Education, Limited (November 2013)
Forfattere: Ravindra Ahuja, Thomas Magnanti og James Orlin
ISBN: 9781292042701

Beskrivelse
Indhold

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.