Combinatorial and global optimization, 

Автор: Korte, Bernhard, Vygen, Jens
Название: Combinatorial Optimization (algorithms and Combinatorics 21) 5th ed.
ISBN: 3642244874 ISBN-13(EAN): 9783642244872
Издательство: Springer
Рейтинг:
Цена: 9077 р.
Наличие на складе: Невозможна поставка.

Описание: 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.

Название: Handbook of Combinatorial Optimization. Print + eReference Information Print + eReference
ISBN: 1461439752 ISBN-13(EAN): 9781461439752
Издательство: Springer
Рейтинг:
Цена: 436734 р.
Наличие на складе: Поставка под заказ.

Описание: Handbook of Combinatorial Optimization

Автор: Schrijver Alexander
Название: Combinatorial Optimization / Polyhedra and Efficiency
ISBN: 3540443894 ISBN-13(EAN): 9783540443896
Издательство: Springer
Рейтинг:
Цена: 17049 р.
Наличие на складе: Поставка под заказ.

Описание: 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
Цена: 18161 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Название: Handbook of Combinatorial Optimization eReference Information . eReference 1-5 vol
ISBN: 1441979964 ISBN-13(EAN): 9781441979964
Издательство: Springer
Рейтинг:
Цена: 349388 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This seven-volume resource serves as a basic, yet comprehensive reference work in combinatorial optimization. It deals with several algorithmic approaches for discrete problems as well as with many combinatorial problems.

Автор: Wolsey, Laurence A. (universite Catholique De Louv
Название: Integer and combinatorial optimization
ISBN: 0471359432 ISBN-13(EAN): 9780471359432
Издательство: Wiley
Рейтинг:
Цена: 24861 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Discrete optimization models are used to tackle a wide variety of problems in many fields, including operations research, management science, engineering, and mathematics. Written by two internationally recognized integer programming experts, this book presents the mathematical foundations, theory, and algorithms of discrete optimization methods.