Research Trends in Combinatorial Optimization Bonn 2008 /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Cook, William (Επιμελητής έκδοσης), Lovász, László (Επιμελητής έκδοσης), Vygen, Jens (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2009.
• Θέματα: Mathematics.; Operations research.; Decision making.; Computer science > Mathematics.; Computer mathematics.; Mathematical optimization.; Management science.; Combinatorics.; Optimization.; Operations Research, Management Science.; Computational Mathematics and Numerical Analysis.; Discrete Mathematics in Computer Science.; Operation Research/Decision Theory.

The editors and authors dedicate this book to Bernhard Korte on the occasion of his seventieth birthday. We, the editors, are happy about the overwhelming feedback to our initiative to honor him with this book and with a workshop in Bonn on November 3–7,2008.Althoughthiswouldbeareasontolookback,wewo...

Πίνακας περιεχομένων:

• 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.