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...
Salvato in:
| Autore principale: | |
|---|---|
| Altri autori: | , |
| Natura: | Livre numérique |
| Lingua: | Anglais |
| Pubblicazione: |
Berlin ; Heidelberg :
Springer : Springer e-books
[20..].
Cham : Springer Nature |
| Soggetti: | |
| Accesso online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
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 |
| LEADER | 04852nam a22003977a 4500 | ||
|---|---|---|---|
| 001 | 940980 | ||
| 008 | 090210q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN131118838 | ||
| 020 | |a 9783540767961 | ||
| 041 | 0 | |a eng | |
| 082 | |a 519.6 | ||
| 084 | |a 90Cxx. 2000 | ||
| 100 | 1 | |a Cook, William, |d 1957- | |
| 245 | 1 | 0 | |a Research trends in combinatorial optimization : |b Bonn 2008 |c edited by William J. Cook, László Lovász, Jens Vygen. |
| 260 | |a Berlin ; |a Heidelberg : |b Springer : |b Springer e-books. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 500 | |a Description d'après consultation du 26 mars 2012 | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 504 | |a Bibliogr. Index | ||
| 505 | 1 | |a 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 | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 520 | |a 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,wewouldratherliketolook forward and see what are the interesting research directions today. This book is written by leading experts in combinatorial optimization. All - pers were carefully reviewed, and eventually twenty-three of the invited papers were accepted for this book. The breadth of topics is typical for the eld: combinatorial optimization builds bridges between areas like combinatorics and graph theory, submodular functions and matroids, network ows and connectivity, approximation algorithms and mat- matical programming, computational geometry and polyhedral combinatorics. All these topics are related, and they are all addressed in this book. Combi- torial optimization is also known for its numerous applications. To limit the scope, however, this book is not primarily about applications, although some are mentioned at various places. Most papers in this volume are surveys that provide an excellent overview of an activeresearcharea,butthisbookalsocontainsmanynewresults.Highlightingmany of the currently most interesting research directions in combinatorial optimization, we hope that this book constitutes a good basis for future research in these areas | ||
| 600 | |a Korte, Bernhard H., |d 1938-2025 | ||
| 650 | |a Mélanges et hommages | ||
| 700 | 1 | |a Lovász, László, |d 1948- |4 pbd | |
| 700 | 1 | |a Vygen, Jens, |d 1967- |4 pbd | |
| 760 | 0 | |t Mathematics and Statistics | |
| 776 | 0 | |t Research trends in combinatorial optimization |z 9783540767954 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/978-3-540-76796-1 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-R5WF7XF2-2 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:747851778 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/978-3-540-76796-1 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:750869402 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/978-3-540-76796-1 |z Accès INSA CVL | |
| 997 | |0 940980 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||