Combinatorial Optimization

Theory and Algorithms

ISBN: 978-3-540-25684-7 (Print) 978-3-540-29297-5 (Online)

Table of contents (22 chapters)

previous Page of 2
  1. No Access

    Book Chapter

    Pages 1-12

    Introduction

  2. No Access

    Book Chapter

    Pages 13-47

    Graphs

  3. No Access

    Book Chapter

    Pages 49-64

    Linear Programming

  4. No Access

    Book Chapter

    Pages 65-90

    Linear Programming Algorithms

  5. No Access

    Book Chapter

    Pages 91-117

    Integer Programming

  6. No Access

    Book Chapter

    Pages 119-141

    Spanning Trees and Arborescences

  7. No Access

    Book Chapter

    Pages 143-156

    Shortest Paths

  8. No Access

    Book Chapter

    Pages 157-189

    Network Flows

  9. No Access

    Book Chapter

    Pages 191-213

    Minimum Cost Flows

  10. No Access

    Book Chapter

    Pages 215-244

    Maximum Matchings

  11. No Access

    Book Chapter

    Pages 245-270

    Weighted Matching

  12. No Access

    Book Chapter

    Pages 271-289

    b-Matchings and T-Joins

  13. No Access

    Book Chapter

    Pages 291-321

    Matroids

  14. No Access

    Book Chapter

    Pages 323-342

    Generalizations of Matroids

  15. No Access

    Book Chapter

    Pages 343-375

    NP-Completeness

  16. No Access

    Book Chapter

    Pages 377-413

    Approximation Algorithms

  17. No Access

    Book Chapter

    Pages 415-424

    The Knapsack Problem

  18. No Access

    Book Chapter

    Pages 426-441

    Bin-Packing

  19. No Access

    Book Chapter

    Pages 443-465

    Multicommodity Flows and Edge-Disjoint Paths

  20. No Access

    Book Chapter

    Pages 467-500

    Network Design Problems

previous Page of 2