Описание: 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 Рейтинг: Цена: 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 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: 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.
Автор: Ding-Zhu Du, Pardalos, Panos M. Название: Handbook of combinatorial optimization ISBN: 0792350197 ISBN-13(EAN): 9780792350194 Издательство: Springer Рейтинг: Цена: 48774 р. Наличие на складе: Нет в наличии.
Описание: Deals with several algorithmic approaches for discrete problems as well as combinatorial problems. This book attempts to bring together various aspects of the this field with emphasis on developments. It is intended for researchers in discrete optimization, and scientists who use combinatorial optimization methods to model and solve problems.
Автор: Cook, W.j. Cunningham, William H. Pulleybank, W. R Название: Combinatorial optimization ISBN: 047155894X ISBN-13(EAN): 9780471558941 Издательство: Wiley Рейтинг: Цена: 26128 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: A complete, highly accessible introduction to one of today`s most exciting areas of applied mathematics One of the youngest, most vital areas of applied mathematics, combinatorial optimization integrates techniques from combinatorics, linear programming, and the theory of algorithms.
Название: Combinatorial optimization and applications ISBN: 3642020259 ISBN-13(EAN): 9783642020254 Издательство: Springer Рейтинг: Цена: 13974 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the refereed proceedings of the Third International Conference on Combinatorial Optimization and Applications, COCOA 2009, held in Huangshan, China, in June 2009.
Название: Combinatorial and global optimization ISBN: 9810248024 ISBN-13(EAN): 9789810248024 Издательство: World Scientific Publishing Рейтинг: Цена: 15048 р. Наличие на складе: Нет в наличии.
Описание: Combinatorial and global optimization problems appear in a wide range of applications in operations research, engineering, and biological and computer science. This is a selection of refereed papers based on talks presented at a conference on "Combinatorial and Global Optimization" held at Crete.
Описание: Contains 41 reviewed papers, selected by the two program committees from a total of 101 submissions. Among the issues addressed are design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, and more.
Combinational optimization (CO) is a topic in applied mathematics, decision science and computer science that consists of finding the best solution from a non-exhaustive search. CO is related to disciplines such as computational complexity theory and algorithm theory, and has important applications in fields such as operations research/management science, artificial intelligence, machine learning, and software engineering.
Advances in Combinatorial Optimization presents a generalized framework for formulating hard combinatorial optimization problems (COPs) as polynomial sized linear programs. Though developed based on the 'traveling salesman problem' (TSP), the framework allows for the formulating of many of the well-known NP-Complete COPs directly (without the need to reduce them to other COPs) as linear programs, and demonstrates the same for three other problems (e.g. the 'vertex coloring problem' (VCP)). This work also represents a proof of the equality of the complexity classes "P" (polynomial time) and "NP" (nondeterministic polynomial time), and makes a contribution to the theory and application of 'extended formulations' (EFs).
On a whole, Advances in Combinatorial Optimization offers new modeling and solution perspectives which will be useful to professionals, graduate students and researchers who are either involved in routing, scheduling and sequencing decision-making in particular, or in dealing with the theory of computing in general.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
