Поиск книг                    Поиск по списку ISBN Расширенный поиск    
  Зарубежные издательства Российские издательства  
   Авторы    Каталог книг    Издательства    Новинки    Учебная литература    Специальные предложения  Бестселлеры
 
 
Книги    
Logobook
Книги зарубежных издательств на иностранных языках
Logobook
Книги российских издательств
Logobook
Представительство в Казахстане
 
Вход в систему   
 Логин
 
 Пароль
   
Регистрация  Забыли?
 
Информация   
Контакты/Адрес/Проезд
Корзина
Ваши заказы
Доставка и Оплата
Заказ по телефону/email
Помощь
Есть вопрос?
О компании
LgBook.ru
FkBook.ru
 
Online Каталоги   
Cambridge University Press
Каталог учебной литературы
по английскому языку >>>

Oxford University Press
Каталог учебной литературы
по английскому языку >>>



Каталог учебной литературы
по английскому языку >>>

Pearson ELT

Читайте отзывы покупателей и оценивайте качество магазина logobook.ru на Яндекс.Маркете

Local Search in Combinatorial Optimization, Aarts E

Local Search in Combinatorial Optimization

Автор: Aarts E
Название:  Local Search in Combinatorial Optimization
Издательство: Princeton UP
Классификация:
Оптимизация
Комбинаторика и теория графа

ISBN: 0691115222
ISBN-13(EAN): 9780691115221
ISBN: 0-691-11522-2
ISBN-13(EAN): 978-0-691-11522-1
Обложка/Формат: Paperback
Страницы: 536
Вес: 0.742 кг.
Язык: ENG
Иллюстрации: 35 tables. 80 line illus.
Размер: 23.27 x 16.26 x 3.18 cm
Читательская аудитория: Tertiary education (us: college)
Рейтинг:
Поставляется из: Англии
Описание: Local search is still the method of choice for NP-hard problems as it provides a robust approach for obtaining solutions to problems of a realistic size in reasonable time. This title covers local search and its variants from both a theoretical and practical point of view.

 Варианты приобретения 
  Кол-во Наличие на складе Цена р. Купить / Отложить
1 Отсутствует. Возможна поставка под заказ. Дата поступления на склад уточняется после оформления заказа
3792.00
 о цене
Добавить в корзину
Add to Wish list

Отзывы покупателей.
Добавить отзыв.
Combinatorial Optimization / Polyhedra and Efficiency

Автор: Schrijver Alexander
Название: Combinatorial Optimization / Polyhedra and Efficiency
ISBN: 3540443894 ISBN-13(EAN): 9783540443896
Издательство: Springer
Цена: 11439 р.
Наличие на складе: Нет в наличии.
Описание: 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.
Купить

Combinatorial Optimization / Polyhedra and Efficiency

Автор: Schrijver Alexander
Название: Combinatorial Optimization / Polyhedra and Efficiency
ISBN: 3540204563 ISBN-13(EAN): 9783540204565
Издательство: Springer
Цена: 8796 р.
Наличие на складе: Нет в наличии.
Описание: From the reviews:Schrijver's 3 volumes on combinatorial optimization reflect the current state of the art in this field, in particular from the viewpoint of polyhedral combinatorics and efficient algorithms. [...] The book offers a masterly introduction with many interesting historical remarks as well as an in-depth survey of combinatorial optimization. It is divided into eight main parts with 83 chapters. The main parts are (I) paths and flows, (II) bipartite matching and covering, (III) nonbipartite matching and covering, (IV) matroids and submodular functions, (V) trees, branchings and connectors, (VI) cliques, stable sets and colouring, (VII) multiflows and disjoint paths and, finally, (VIII) hypergraphs.[...] The reader is supposed to have a basic knowledge of graph theory and linear as well as integer programming. The author gives short and elegant proofs to all main results. [...]These three volumes contain an immense richness of results up to 2002 and will prove to be indispensible for any further research in the field of combinatorial optimization.Rainer E. Burkard (Graz) Zentralblatt Math Database, 2003 [..] Now comes Schrijver's book, a current and extremely comprehensive account, running 1,451 pages; by itself the bibliography would make a long book. But even as the book provides reference material to satisfy the experts, strong undergraduates will profit by dipping straight into nearly any chapter. Mathematics and computer science students should consult it, both to supplement their theoretical coursework or to find algorithms for practical projects. Summing Up: All three books: Recommended. Upper-division undergraduates through faculty. American Library Association, 2003
Купить

The Cross-Entropy Method / A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation and Machine Learning

Автор: Rubinstein Reuven Y., Kroese Dirk P.
Название: The Cross-Entropy Method / A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation and Machine Learning
ISBN: 038721240X ISBN-13(EAN): 9780387212401
Издательство: Springer
Цена: 6772 р.
Наличие на складе: Нет в наличии.
Описание: The cross-entropy (CE) method is one of the most significant developments in stochastic optimization and simulation in recent years. This book explains in detail how and why the CE method works. The CE method involves an iterative procedure where each iteration can be broken down into two phases: (a) generate a random data sample (trajectories, vectors, etc.) according to a specified mechanism; (b) update the parameters of the random mechanism based on this data in order to produce a "better" sample in the next iteration. The simplicity and versatility of the method is illustrated via a diverse collection of optimization and estimation problems.Reuven Y. Rubinstein is the Milford Bohm Professor of Management at the Faculty of Industrial Engineering and Management at the Technion (Israel Institute of Technology). His primary areas of interest are stochastic modelling, applied probability, and simulation. He has written over 100 articles and has published five books. He is the pioneer of the well-known score-function and cross-entropy methods.Dirk P. Kroese is an expert on the cross-entropy method. He has published close to 40 papers in a wide range of subjects in applied probability and simulation. He is on the editorial board of Methodology and Computing in Applied Probability and is Guest Editor of the Annals of Operations Research. He has held research and teaching positions at Princeton University and The University of Melbourne, and is currently working at the Department of Mathematics of The University of Queensland.Computing Reviews, Stochastic Programming November, 2004"...I wholeheartedly recommend this book to anybody who is interested in stochastic optimization or simulation-based performance analysis of stochastic systems." Gazette of the Australian Mathematical Society, vol. 32 (3) 2005"This book describes the cross-entropy method for a range of optimization problems. … It is a substantial contribution to stochastic optimization and more generally to the stochastic numerical methods theory." (V.V.Fedorov, Short Book Reviews, Vol. 25 (1), 2005)"Since the CE method is a young and developing field, there is no book available in this area where the two authors are the pioneers. Therefore, it is quite a unique book and it may become a classic reference in the CE method literature." Technometrics, February 2005
Купить

Combinatorial optimization theory and algorithms 4th ed.

Автор: Korte
Название: Combinatorial optimization theory and algorithms 4th ed.
ISBN: 3540718435 ISBN-13(EAN): 9783540718437
Издательство: Springer
Цена: 5276 р.
Наличие на складе: Невозможна поставка.
Описание: A comprehensive textbook on combinatorial optimization that puts emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It contains a chapter on facility location problems.
Купить

Integer and combinatorial optimization

Автор: Wolsey, Laurence A. (universite Catholique De Louv
Название: Integer and combinatorial optimization
ISBN: 0471359432 ISBN-13(EAN): 9780471359432
Издательство: Wiley
Цена: 9895 р.
Наличие на складе: Поставка под заказ.
Описание: Written by international experts in the field of integer programming, this text and reference presents the mathematical foundations, theory, and algorithms of discrete optimization methods, incorporating many techniques as well as numerous examples and model formulations.
Купить

Combinatorial Optimization

Автор: Paschos
Название: Combinatorial Optimization
ISBN: 1848211465 ISBN-13(EAN): 9781848211469
Издательство: Wiley
Цена: 39303 р.
Наличие на складе: Поставка под заказ.
Купить

Concepts of Combinatorial Optimization

Автор: Paschos
Название: Concepts of Combinatorial Optimization
ISBN: 1848211473 ISBN-13(EAN): 9781848211476
Издательство: Wiley
Цена: 9900 р.
Наличие на складе: Поставка под заказ.
Купить

Applications of Combinatorial Optimization

Автор: Paschos
Название: Applications of Combinatorial Optimization
ISBN: 184821149X ISBN-13(EAN): 9781848211490
Издательство: Wiley
Цена: 9900 р.
Наличие на складе: Поставка под заказ.
Купить

Paradigms of Combinatorial Optimization

Автор: Paschos
Название: Paradigms of Combinatorial Optimization
ISBN: 1848211481 ISBN-13(EAN): 9781848211483
Издательство: Wiley
Цена: 19503 р.
Наличие на складе: Поставка под заказ.
Купить

Combinatorial optimization

Автор: Cook, W.j. Cunningham, William H. Pulleybank, W. R
Название: Combinatorial optimization
ISBN: 047155894X ISBN-13(EAN): 9780471558941
Издательство: Wiley
Цена: 10395 р.
Наличие на складе: Поставка под заказ.
Описание: Combinatorial optimization is a topic in discrete mathematics and theoretical computer science. This book covers the theory, algorithms and applications in a manner which should be accessible to researchers and post graduate students in mathematics and computer science.
Купить

Iterative Methods in Combinatorial Optimization

Автор: Lau Lap-Chi
Название: Iterative Methods in Combinatorial Optimization
ISBN: 0521189438 ISBN-13(EAN): 9780521189439
Издательство: Cambridge Academ
Цена: 2464 р.
Наличие на складе: Поставка под заказ.
Купить

Online stochastic combinatorial optimization

Автор: Hentenryck, Pascal Van Bent, Russell
Название: Online stochastic combinatorial optimization
ISBN: 0262220806 ISBN-13(EAN): 9780262220804
Издательство: MIT Press
Цена: 2074 р.
Наличие на складе: Нет в наличии.
Описание: Online decision making under uncertainty and time constraints represents one of the most challenging problems for robust intelligent agents. This book presents a different framework, online stochastic optimization, to address this challenge. It offers online stochastic algorithms implementing the framework, and demonstrates a many applications.
Купить


 
ООО "Логосфера " Тел:(495) 748-51-16 Факс: (495) 689-73-83 доб.116 www.logobook.ru
Visa, Master Card, Diners, AMEX, JCB, Web Money, Yandex Money Сбербанк онлайн | | | | | | | | | | - - - - - - - - - - - - - - - - - - - -