Slicing the Truth: On the Computable and Reverse Mathematics of Combinatorial Principles, Hirschfeldt Denis R.
Автор: Schrijver Alexander Название: Combinatorial Optimization / Polyhedra and Efficiency ISBN: 3540443894 ISBN-13(EAN): 9783540443896 Издательство: Springer Рейтинг: Цена: 113660.00 T Наличие на складе: Поставка под заказ. Описание: This book offers an in-depth overview of polyhedral methods and efficient algorithms in combinatorial optimization.These methods form a broad, coherent and powerful kernel in combinatorial optimization, with strong links to discrete mathematics, mathematical programming and computer science. In eight parts, various areas are treated, each starting with an elementary introduction to the area, with short, elegant proofs of the principal results, and each evolving to the more advanced methods and results, with full proofs of some of the deepest theorems in the area. Over 4000 references to further research are given, and historical surveys on the basic subjects are presented.
Автор: Korte, Bernhard, Vygen, Jens Название: Combinatorial Optimization (algorithms and Combinatorics 21) 5th ed. ISBN: 3642244874 ISBN-13(EAN): 9783642244872 Издательство: Springer Рейтинг: Цена: 60510.00 T Наличие на складе: Невозможна поставка. Описание: This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.
Автор: Edelsbrunner Herbert Название: Algorithms in Combinatorial Geometry ISBN: 3642648738 ISBN-13(EAN): 9783642648731 Издательство: Springer Цена: 121070.00 T Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: Vladimir N. Sachkov , Translated by V. Kolchin Название: Combinatorial Methods in Discrete Mathematics ISBN: 0521455138 ISBN-13(EAN): 9780521455138 Издательство: Cambridge Academ Рейтинг: Цена: 121440.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: A 1996 account of some complex problems of discrete mathematics in a simple and unified form. A distinctive aspect of the book is the large number of asymptotic formulae derived. This is an important book, describing many ideas not previously available in English; the author has taken the chance to update the text and references where appropriate.
Казахстан, 010000 г. Астана, проспект Туран 43/5, НП2 (офис 2) ТОО "Логобук" Тел:+7 707 857-29-98 ,+7(7172) 65-23-70 www.logobook.kz
