Skip to main content
main-content

Inhaltsverzeichnis

Frontmatter

1. Introduction

Without Abstract

2. Graphs

Without Abstract

3. Linear Programming

Without Abstract

4. Linear Programming Algorithms

Without Abstract

5. Integer Programming

Without Abstract

6. Spanning Trees and Arborescences

Without Abstract

7. Shortest Paths

Without Abstract

8. Network Flows

Without Abstract

9. Minimum Cost Flows

Without Abstract

10. Maximum Matchings

Without Abstract

11. Weighted Matching

Without Abstract

12. b-Matchings and T-Joins

Without Abstract

13. Matroids

Without Abstract

14. Generalizations of Matroids

Without Abstract

15. NP-Completeness

16. Approximation Algorithms

Without Abstract

17. The Knapsack Problem

Without Abstract

18. Bin-Packing

Without Abstract

19. Multicommodity Flows and Edge-Disjoint Paths

Without Abstract

20. Network Design Problems

Without Abstract

21. The Traveling Salesman Problem

Without Abstract

22. Facility Location

Without Abstract

Backmatter

Weitere Informationen

Premium Partner

    Bildnachweise