Research Trends in Combinatorial Optimization: Bonn 2008 (Hardcover, 2009)

On the Location and p-Median Polytopes.- Facet Generating Techniques.- Antimatroids, Betweenness, Convexity.- Euler Complexes.- Strongly Polynomial Algorithm for the Intersection of a Line with a Polymatroid.- A Survey on Covering Supermodular Functions.- Theory of Principal Partitions Revisited.- Locally Dense Independent Sets in Regular Graphs of Large Girth-An Example of a New Approach.- Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems.- The Unbounded Knapsack Problem.- Recent Developments in Discrete Convex Analysis.- Multiflow Feasibility: An Annotated Tableau.- Many Facets of Dualities.- On the Structure of Graphs Vertex Critical with Respect to Connected Domination.- LS-LIB: A Library of Tools for Solving Production Planning Problems.- From Spheres to Spheropolyhedra: Generalized Distinct Element Methodology and Algorithm Analysis.- Graphic Submodular Function Minimization: A Graphic Approach and Applications.- Matroids-the Engineers' Revenge.- On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming.- Single-Sink Multicommodity Flow with Side Constraints.- An Introduction to Network Flows over Time.- Edge-Connectivity Augmentations of Graphs and Hypergraphs.- Some Problems on Approximate Counting in Graphs and Matroids.