Analysis and Design of Algorithms in Combinatorial Optimization, Giorgio Ausiello; M. Lucertini
Автор: Sundaram, Rangarajan K. Название: A First Course in Optimization Theory ISBN: 0521497701 ISBN-13(EAN): 9780521497701 Издательство: Cambridge Academ Рейтинг: Цена: 6811.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book, first published in 1996, introduces students to optimization theory and its use in economics and allied disciplines.
Автор: Andreas S. Schulz; Martin Skutella; Sebastian Stil Название: Gems of Combinatorial Optimization and Graph Algorithms ISBN: 3319249703 ISBN-13(EAN): 9783319249704 Издательство: Springer Рейтинг: Цена: 9781.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Are you looking for new lectures for your course on algorithms, combinatorial optimization, or algorithmic game theory? This volume is aimed at readers with some familiarity of combinatorial optimization, and appeals to researchers, graduate students, and advanced undergraduate students alike.
Автор: Klaus Jansen; Stefano Leonardi; Vijay Vazirani Название: Approximation Algorithms for Combinatorial Optimization ISBN: 3540441867 ISBN-13(EAN): 9783540441861 Издательство: Springer Рейтинг: Цена: 9781.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Compiled from the proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, this volume contains 20 revised full papers. Coverage includes design and analysis of approximation algorithms, inapproximability results and online problems.
Автор: Lau Название: Iterative Methods in Combinatorial Optimization ISBN: 1107007518 ISBN-13(EAN): 9781107007512 Издательство: Cambridge Academ Рейтинг: Цена: 12830.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids and flows.
Автор: Cook, W.j. Cunningham, William H. Pulleybank, W. R Название: Combinatorial optimization ISBN: 047155894X ISBN-13(EAN): 9780471558941 Издательство: Wiley Рейтинг: Цена: 26128.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
Автор: Paschos Название: Concepts of Combinatorial Optimization 2e ISBN: 1848216564 ISBN-13(EAN): 9781848216563 Издательство: Wiley Рейтинг: Цена: 23277.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
Автор: Paschos Название: Applications of Combinatorial Optimization 2e ISBN: 1848216580 ISBN-13(EAN): 9781848216587 Издательство: Wiley Рейтинг: Цена: 24861.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.
Описание: This text presents various new results within the areas covered by the workshop.
Автор: Schrijver Alexander Название: Combinatorial Optimization / Polyhedra and Efficiency ISBN: 3540443894 ISBN-13(EAN): 9783540443896 Издательство: Springer Рейтинг: Цена: 17049.00 р. Наличие на складе: Поставка под заказ.
Описание: 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.
Автор: Asmussen Название: Stochastic Simulation: Algorithms and Analysis ISBN: 038730679X ISBN-13(EAN): 9780387306797 Издательство: Springer Рейтинг: Цена: 6981.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Sampling-based computational methods have become a fundamental part of the numerical toolset of practitioners and researchers across an enormous number of different applied domains and academic disciplines. This book provides a broad treatment of such sampling-based methods , as well as accompanying mathematical analysis of the convergence properties of the methods discussed . The reach of the ideas is illustrated by discussing a wide range of applications and the models that have found wide usage. The first half of the book focusses on general methods, whereas the second half discusses model-specific algorithms. Given the wide range of examples, exercises and applications students, practitioners and researchers in probability, statistics, operations research, economics, finance, engineering as well as biology and chemistry and physics will find the book of value. Soren Asmussen is Professor of Applied Probability at Aarhus University, Denmark and Peter Glynn is Thomas Ford Professor of Engineering at Stanford University.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
