内容

目次

1. Introduction. 2. Paths, Trees and Cycles. 3. Algorithm Design andAnalysis. 4. Shortest Paths: Label Setting Algorithms. 5. Shortest Paths:Label Correcting Algorithms. 6. Maximum Flows: Basic Ideas. 7. MaximumFlows: Polynomial Algorithms. 8. Maximum Flows: Additional Topics. 9.Minimum Cost Flows: Basic Algorithms. 10. Minimum Cost Flows: PolynomialAlgorithms. 11. Minimum Cost Flows: Network Simplex Algorithms. 12.Assignments and Matchings. 13. Minimum Spanning Trees. 14. Convex CostFlows. 15. Generalized Flows. 16. Lagrangian Relaxation and NetworkOptimization. 17. Multicommodity Flows. 18. Computational Testing ofAlgorithms. 19. Additional Applications. Appendix A: Data Structures.Appendix B: NP-Completeness. Appendix C: Linear Programming. Index.