Applications of Combinatorial Optimization 2e, Paschos
Автор: Schrijver Alexander Название: Combinatorial Optimization / Polyhedra and Efficiency ISBN: 3540443894 ISBN-13(EAN): 9783540443896 Издательство: Springer Рейтинг: Цена: 18672 р. Наличие на складе: Нет в наличии.
Описание: 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.
Автор: Paschos Название: Concepts of Combinatorial Optimization 2e ISBN: 1848216564 ISBN-13(EAN): 9781848216563 Издательство: Wiley Рейтинг: Цена: 25217 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aim to cover a wide range of topics in this area.
Автор: Jano van Hemert; Carlos Cotta Название: Evolutionary Computation in Combinatorial Optimization ISBN: 3540786031 ISBN-13(EAN): 9783540786030 Издательство: Springer Рейтинг: Цена: 10713 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 8th European Conference EvoCOP 2008 Naples Italy March 26-28 2008 Proceedings.
Автор: Wolsey, Laurence A. (universite Catholique De Louv Название: Integer and combinatorial optimization ISBN: 0471359432 ISBN-13(EAN): 9780471359432 Издательство: Wiley Рейтинг: Цена: 26933 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
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