Research trends in combinatorial optimization : Bonn 2008

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

Mô tả đầy đủ

Đã lưu trong:
Chi tiết về thư mục
Tác giả chính: Cook, William, 1957-
Tác giả khác: Lovász, László, 1948- (Giám đốc xuất bản), Vygen, Jens, 1967- (Giám đốc xuất bản)
Định dạng: Livre numérique
Ngôn ngữ:Anglais
Được phát hành: Berlin ; Heidelberg : Springer : Springer e-books [20..].
Cham : Springer Nature
Những chủ đề:
Truy cập trực tuyến:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Chú thích: Description d'après consultation du 26 mars 2012
Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Research trends in combinatorial optimization, 9783540767954
Mục lục:
  • 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