Combinatorial Optimization

Theory and Algorithms

Authors:

ISBN: 978-3-642-24487-2 (Print) 978-3-642-24488-9 (Online)

Table of contents (22 chapters)

previous Page of 2
  1. Front Matter

    Pages I-XIX

  2. No Access

    Book Chapter

    Pages 1-12

    Introduction

  3. No Access

    Book Chapter

    Pages 13-49

    Graphs

  4. No Access

    Book Chapter

    Pages 51-71

    Linear Programming

  5. No Access

    Book Chapter

    Pages 73-99

    Linear Programming Algorithms

  6. No Access

    Book Chapter

    Pages 101-129

    Integer Programming

  7. No Access

    Book Chapter

    Pages 131-155

    Spanning Trees and Arborescences

  8. No Access

    Book Chapter

    Pages 157-171

    Shortest Paths

  9. No Access

    Book Chapter

    Pages 173-209

    Network Flows

  10. No Access

    Book Chapter

    Pages 211-239

    Minimum Cost Flows

  11. No Access

    Book Chapter

    Pages 241-271

    Maximum Matchings

  12. No Access

    Book Chapter

    Pages 273-299

    Weighted Matching

  13. No Access

    Book Chapter

    Pages 301-320

    b-Matchings and T-Joins

  14. No Access

    Book Chapter

    Pages 321-353

    Matroids

  15. No Access

    Book Chapter

    Pages 355-375

    Generalizations of Matroids

  16. No Access

    Book Chapter

    Pages 377-412

    NP-Completeness

  17. No Access

    Book Chapter

    Pages 413-457

    Approximation Algorithms

  18. No Access

    Book Chapter

    Pages 459-470

    The Knapsack Problem

  19. No Access

    Book Chapter

    Pages 471-488

    Bin-Packing

  20. No Access

    Book Chapter

    Pages 489-520

    Multicommodity Flows and Edge-Disjoint Paths

  21. No Access

    Book Chapter

    Pages 521-556

    Network Design Problems

previous Page of 2