2009

Research Trends in Combinatorial Optimization

Bonn 2008

Editors:

ISBN: 978-3-540-76795-4 (Print) 978-3-540-76796-1 (Online)

Table of contents (23 chapters)

previous Page of 2
  1. Front Matter

    Pages i-xviii

  2. No Access

    Book Chapter

    Pages 1-31

    On the Location and p-Median Polytopes

  3. No Access

    Book Chapter

    Pages 33-55

    Facet Generating Techniques

  4. No Access

    Book Chapter

    Pages 57-64

    Antimatroids, Betweenness, Convexity

  5. No Access

    Book Chapter

    Pages 65-68

    Euler Complexes

  6. No Access

    Book Chapter

    Pages 69-85

    Strongly Polynomial Algorithm for the Intersection of a Line with a Polymatroid

  7. No Access

    Book Chapter

    Pages 87-126

    A Survey on Covering Supermodular Functions

  8. No Access

    Book Chapter

    Pages 127-162

    Theory of Principal Partitions Revisited

  9. No Access

    Book Chapter

    Pages 163-183

    Locally Dense Independent Sets in Regular Graphs of Large Girth—An Example of a New Approach

  10. No Access

    Book Chapter

    Pages 185-200

    Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems

  11. No Access

    Book Chapter

    Pages 201-217

    The Unbounded Knapsack Problem

  12. No Access

    Book Chapter

    Pages 219-260

    Recent Developments in Discrete Convex Analysis

  13. No Access

    Book Chapter

    Pages 261-283

    Multiflow Feasibility: An Annotated Tableau

  14. No Access

    Book Chapter

    Pages 285-302

    Many Facets of Dualities

  15. No Access

    Book Chapter

    Pages 303-315

    On the Structure of Graphs Vertex Critical with Respect to Connected Domination

  16. No Access

    Book Chapter

    Pages 317-346

    LS-LIB: A Library of Tools for Solving Production Planning Problems

  17. No Access

    Book Chapter

    Pages 347-363

    From Spheres to Spheropolyhedra: Generalized Distinct Element Methodology and Algorithm Analysis

  18. No Access

    Book Chapter

    Pages 365-385

    Graphic Submodular Function Minimization: A Graphic Approach and Applications

  19. No Access

    Book Chapter

    Pages 387-398

    Matroids—the Engineers’ Revenge

  20. No Access

    Book Chapter

    Pages 399-428

    On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming

  21. No Access

    Book Chapter

    Pages 429-450

    Single-Sink Multicommodity Flow with Side Constraints

previous Page of 2