Research Trends in Combinatorial Optimization: Bonn 2008
Editat de William J. Cook, László Lovász, Jens Vygenen Limba Engleză Hardback – 5 noi 2008
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 635.55 lei 6-8 săpt. | |
Springer Berlin, Heidelberg – 19 oct 2010 | 635.55 lei 6-8 săpt. | |
Hardback (1) | 642.08 lei 6-8 săpt. | |
Springer Berlin, Heidelberg – 5 noi 2008 | 642.08 lei 6-8 săpt. |
Preț: 642.08 lei
Preț vechi: 755.38 lei
-15% Nou
Puncte Express: 963
Preț estimativ în valută:
122.89€ • 128.09$ • 102.30£
122.89€ • 128.09$ • 102.30£
Carte tipărită la comandă
Livrare economică 04-18 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540767954
ISBN-10: 3540767959
Pagini: 575
Ilustrații: XIII, 562 p.
Dimensiuni: 155 x 235 x 41 mm
Greutate: 0.99 kg
Ediția:2009
Editura: Springer Berlin, Heidelberg
Colecția Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540767959
Pagini: 575
Ilustrații: XIII, 562 p.
Dimensiuni: 155 x 235 x 41 mm
Greutate: 0.99 kg
Ediția:2009
Editura: Springer Berlin, Heidelberg
Colecția Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.
Recenzii
Aus den Rezensionen:“Das Gebiet der kombinatorischen Optimierung umfasst ein weites Spektrum von verschiedenen mathematischen Problemen und Methoden, und ist sowohl aus praktischer als auch aus theoretischer Sicht interessant. Der praktische Nutzen ist offensichtlich, denn in fast jedem Bereich, der mathematische Methoden zur Analyse oder zur Optimierung verwendet ... treten an prominenter Stelle anspruchsvolle kombinatorische Optimierungsprobleme auf. Ein innermathematisch reizvoller Aspekt wird im Vorwort des rezensierten Buches schön beschrieben ... Insgesamt kann man konstatieren, daß das Buch unbedingt zu empfehlen ist für alle ...“ (Thomas Kalinowski, in: RHO Mathematik Verein www.math.uni-rostock.de/rho, September/2009)
Caracteristici
Includes supplementary material: sn.pub/extras