Combinatorial Optimization

Theory and Algorithms

Authors:

ISBN: 978-3-540-71843-7 (Print) 978-3-540-71844-4 (Online)

Table of contents (22 chapters)

previous Page of 2
  1. Front Matter

    Pages I-XVII

  2. No Access

    Book Chapter

    Pages 1-12

    Introduction

  3. No Access

    Book Chapter

    Pages 13-47

    Graphs

  4. No Access

    Book Chapter

    Pages 49-69

    Linear Programming

  5. No Access

    Book Chapter

    Pages 71-97

    Linear Programming Algorithms

  6. No Access

    Book Chapter

    Pages 99-126

    Integer Programming

  7. No Access

    Book Chapter

    Pages 127-149

    Spanning Trees and Arborescences

  8. No Access

    Book Chapter

    Pages 151-164

    Shortest Paths

  9. No Access

    Book Chapter

    Pages 165-197

    Network Flows

  10. No Access

    Book Chapter

    Pages 199-226

    Minimum Cost Flows

  11. No Access

    Book Chapter

    Pages 227-256

    Maximum Matchings

  12. No Access

    Book Chapter

    Pages 257-283

    Weighted Matching

  13. No Access

    Book Chapter

    Pages 285-303

    b-Matchings and T-Joins

  14. No Access

    Book Chapter

    Pages 305-336

    Matroids

  15. No Access

    Book Chapter

    Pages 337-357

    Generalizations of Matroids

  16. No Access

    Book Chapter

    Pages 359-392

    NP-Completeness

  17. No Access

    Book Chapter

    Pages 393-437

    Approximation Algorithms

  18. No Access

    Book Chapter

    Pages 439-448

    The Knapsack Problem

  19. No Access

    Book Chapter

    Pages 449-465

    Bin-Packing

  20. No Access

    Book Chapter

    Pages 467-489

    Multicommodity Flows and Edge-Disjoint Paths

  21. No Access

    Book Chapter

    Pages 491-525

    Network Design Problems

previous Page of 2