Finite Geometry and Combinatorial Applications, Ball

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

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

Автор: Edelsbrunner Herbert
Название: Algorithms in Combinatorial Geometry
ISBN: 3642648738 ISBN-13(EAN): 9783642648731
Издательство: Springer
Цена: 121070.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.

Автор: Pach, Janos
Название: Combinatorial geometry and its algorithmic applications : the alcala lectures
ISBN: 0821846914 ISBN-13(EAN): 9780821846919
Издательство: Mare Nostrum (Eurospan)
Рейтинг:
Цена: 87650.00 T
Наличие на складе: Нет в наличии.
Описание: The Ricci flow uses methods from analysis to study the geometry and topology of manifolds. With the third part of their volume on techniques and applications of the theory, the authors give a presentation of Hamilton`s Ricci flow for graduate students and mathematicians interested in working in the subject, with an emphasis on the geometric and analytic aspects.

Автор: Michael J. Brusco; Stephanie Stahl
Название: Branch-and-Bound Applications in Combinatorial Data Analysis
ISBN: 1441920390 ISBN-13(EAN): 9781441920393
Издательство: Springer
Рейтинг:
Цена: 121110.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Supplementary material, such as computer programs, are provided on the world wide web.Dr. Brusco is an editorial board member for the Journal of Classification, and a member of the Board of Directors for the Classification Society of North America.

Автор: T-H. Hubert Chan; Minming Li; Lusheng Wang
Название: Combinatorial Optimization and Applications
ISBN: 3319487485 ISBN-13(EAN): 9783319487489
Издательство: Springer
Рейтинг:
Цена: 91310.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the 10th International Conference on Combinatorial Optimization and Applications, COCOA 2016, held in Hong Kong, China, in December 2016. The 60 full papers included in the book were carefully reviewed and selected from 122 submissions.

Автор: Martini, Horst Boltyanski, V.g. Soltan, P.s.
Название: Excursions into combinatorial geometry
ISBN: 3540613412 ISBN-13(EAN): 9783540613411
Издательство: Springer
Рейтинг:
Цена: 51200.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Discusses the combinatorial geometry of convex bodies in finite-dimensional spaces. The text includes a general introduction to geometric convexity and investigates d-convexity and H-convexity. Open research problems are considered in detail.

Автор: Ewald
Название: Combinatorial convexity and algebraic geometry
ISBN: 0387947558 ISBN-13(EAN): 9780387947556
Издательство: Springer
Цена: 55850.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Presents an introduction to the theory of convex polytopes and polyhedral sets, to algebraic geometry, and to the connections between these fields, known as the theory of toric varieties. This book covers the theory of polytopes. It describes toric varieties in an elementary way.

Автор: Gunnar Fl?ystad; Trygve Johnsen; Andreas Leopold K
Название: Combinatorial Aspects of Commutative Algebra and Algebraic Geometry
ISBN: 3642268285 ISBN-13(EAN): 9783642268281
Издательство: Springer
Рейтинг:
Цена: 153720.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The Abel Symposium 2009 "Combinatorial aspects of Commutative Algebra and Algebraic Geometry", held at Voss, Norway, featured talks by leading researchers in the field. This is the proceedings of the Symposium, presenting contributions on syzygies, tropical geometry, Boij-Soederberg theory, Schubert calculus, and quiver varieties.

Автор: Edelsbrunner
Название: Algorithms in combinatorial geometry
ISBN: 354013722X ISBN-13(EAN): 9783540137221
Издательство: Springer
Рейтинг:
Цена: 121070.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book offers a modern approach to computational geo- metry, an area thatstudies the computational complexity of geometric problems. Combinatorial investigations play an important role in this study.