Topology and Combinatorics of 3-Manifolds, Klaus Johannson

Автор: Flajolet
Название: Analytic Combinatorics
ISBN: 0521898064 ISBN-13(EAN): 9780521898065
Издательство: Cambridge Academ
Рейтинг:
Цена: 88710.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The definitive treatment of analytic combinatorics. This self-contained text covers the mathematics underlying the analysis of discrete structures, with thorough treatment of a large number of applications. Exercises, examples, appendices and notes aid understanding: ideal for individual self-study or for advanced undergraduate or graduate courses.

Автор: Stanley
Название: Enumerative Combinatorics
ISBN: 1107602629 ISBN-13(EAN): 9781107602625
Издательство: Cambridge Academ
Рейтинг:
Цена: 39920.00 T
Наличие на складе: Есть
Описание: Richard Stanley`s two-volume basic introduction to enumerative combinatorics has become the standard guide to the topic for students and experts alike. This thoroughly revised second edition of Volume 1 includes more than 300 new exercises, many with solutions, updated and expanded chapter bibliographies and substantial new material on permutation statistics.

Автор: Author Unknown
Название: HANDBOOK OF COMBINATORICS VOLUME 1,I
ISBN: 0444823468 ISBN-13(EAN): 9780444823465
Издательство: Elsevier Science
Рейтинг:
Цена: 190890.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Covering important results and current trends and issues across the spectrum of combinatorics, this volume covers finite sets and relations, matroids, symmetric structures, and combinatorial structures in geometry and number theory.

Автор: Kalai, Gil; Ziegler, Gunter M. (Eds.)
Название: Polytopes - combinatorics and computation
ISBN: 3764363517 ISBN-13(EAN): 9783764363512
Издательство: Springer
Рейтинг:
Цена: 32560.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Questions that arose from linear programming and combinatorial optimization have been a driving force for modern polytope theory, such as the diameter questions motivated by the desire to understand the complexity of the simplex algorithm, or the need to study facets for use in cutting plane procedures.

Автор: 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.