+7(495) 980-12-10
  10:00-18:00 пн-пт
    shop@logobook.ru
   
    Поиск книг                    Поиск по списку ISBN Расширенный поиск    
  Зарубежные издательства Российские издательства  
   Авторы    Каталог книг    Издательства    Новинки    Учебная литература    Специальные предложения  Бестселлеры
 
 
Книги    
Logobook
Книги зарубежных издательств на иностранных языках
Logobook
Книги российских издательств
Logobook
Представительство в Казахстане
 
Вход в систему   
 
Регистрация  Забыли?
 
Информация   
Контакты/Адрес/Проезд
Корзина
Ваши заказы
Доставка и Оплата
Заказ по телефону/email
Помощь
Есть вопрос?
О компании
LgBook.ru
FkBook.ru
 
Online Каталоги   
Cambridge University Press
Каталог учебной литературы
по английскому языку >>>

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



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

Pearson ELT

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

Combinatorial Optimization / Polyhedra and Efficiency, Schrijver Alexander

Combinatorial Optimization / Polyhedra and Efficiency

Автор: Schrijver Alexander
Название:  Combinatorial Optimization / Polyhedra and Efficiency   (Комбинаторная оптимизация / многогранники и эффективность)
Издательство: Springer
Классификация:
Религия и верования
Численный анализ
Оптимизация
Комбинаторика и теория графа
Математическая теория вычисления

ISBN: 3540443894
ISBN-13(EAN): 9783540443896
ISBN: 3-540-44389-4
ISBN-13(EAN): 978-3-540-44389-6
Обложка/Формат: Hardback
Страницы: 1988
Вес: 3.326 кг.
Дата издания: 10.12.2002
Серия: Algorithms and combinatorics
Язык: ENG
Иллюстрации: Vol. a: xxxviii, 648 s. vol. b: xxxiv, 570 s. vol
Размер: 25.15 x 17.15 x 13.97 cm
Читательская аудитория: Postgraduate, research & scholarly
Подзаголовок: Polyhedra and efficiency
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Германии
Описание: 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.
Описание: Provides an overview of polyhedral methods and efficient algorithms in combinatorial optimization. This work features methods that form a coherent and powerful kernel in combinatorial optimization, with strong links to discrete mathematics, mathematical programming and computer science.
Дополнительное описание: Формат: 235x155
Круг читателей: Mathematicians, computer scientists, operations researchers, economists
Ключевые слова: combinatorial optimization
graph theory
integer programming
polyhedral combinatorics
polynomial-time algorithms
Язык: eng
Оглавление: Introduction.- Paths and Flows.- Bipartite Matching and Covering.- Nonbipartite Matching and Covering.- Matroids and Submodular Functions.- Trees, Branchings, and Connectors.- Cliques, Stable Sets and Colouring.- Multiflows and Disjoint Paths.- Hypergraphs.- Survey of Problems, Questions and Conjectures.- References.- Name Index.- Subject Index.



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

Отзывы покупателей.
Добавить отзыв.
Computational Combinatorial Optimization / Optimal or Provably Near-Optimal Solutions

Автор: JГјnger Michael, Naddef Denis
Название: Computational Combinatorial Optimization / Optimal or Provably Near-Optimal Solutions
ISBN: 3540428771 ISBN-13(EAN): 9783540428770
Издательство: Springer
Цена: 4462 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.
Описание: This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches. Polyhedral combinatorics as the mathematical backbone of successful algorithms are covered from many perspectives, in particular, polyhedral projection and lifting techniques and the importance of modeling are extensively discussed. Applications to prominent combinatorial optimization problems, e.g., in production and transport planning, are treated in many places; in particular, the book contains a state-of-the-art account of the most successful techniques for solving the traveling salesman problem to optimality.
Купить

Combinatorial Optimization (algorithms and Combinatorics 21) 5th ed.

Автор: Korte, Bernhard, Vygen, Jens
Название: Combinatorial Optimization (algorithms and Combinatorics 21) 5th ed.
ISBN: 3642244874 ISBN-13(EAN): 9783642244872
Издательство: Springer
Цена: 5001 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.
Описание: 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.
Купить

Algorithms in Combinatorial Geometry

Автор: Edelsbrunner Herbert
Название: Algorithms in Combinatorial Geometry
ISBN: 3642648738 ISBN-13(EAN): 9783642648731
Издательство: Springer
Цена: 10006 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.
Купить

Iterative Methods in Combinatorial Optimization

Автор: Lau
Название: Iterative Methods in Combinatorial Optimization
ISBN: 0521189438 ISBN-13(EAN): 9780521189439
Издательство: Cambridge Academ
Цена: 3154 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.
Описание: With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. 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. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms.
Купить

Combinatorial optimization

Автор: Cook, W.j. Cunningham, William H. Pulleybank, W. R
Название: Combinatorial optimization
ISBN: 047155894X ISBN-13(EAN): 9780471558941
Издательство: Wiley
Цена: 9240 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.
Описание: 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.
Купить

Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

Автор: Chandra Chekuri; Klaus Jansen; Jos? D.P. Rolim; Lu
Название: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
ISBN: 3540282394 ISBN-13(EAN): 9783540282396
Издательство: Springer
Цена: 7699 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.
Описание: 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.
Купить

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Автор: Willem-Jan van Hoeve; Elvin Coban
Название: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
ISBN: 3642019285 ISBN-13(EAN): 9783642019289
Издательство: Springer
Цена: 5389 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.
Описание: Constitutes the refereed proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2009, held in Pittsburgh, PA, USA, in May 2009.
Купить

Iterative Methods in Combinatorial Optimization

Автор: Lau
Название: Iterative Methods in Combinatorial Optimization
ISBN: 1107007518 ISBN-13(EAN): 9781107007512
Издательство: Cambridge Academ
Цена: 6311 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.
Описание: With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. 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. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms.
Купить

Probabilistic Combinatorial Optimization on Graphs

Автор: Murat
Название: Probabilistic Combinatorial Optimization on Graphs
ISBN: 1905209339 ISBN-13(EAN): 9781905209330
Издательство: Wiley
Цена: 10912 р.
Наличие на складе: Нет в наличии.
Описание: This title provides a comprehensive survey over the subject of probabilistic combinatorial optimization, discussing probabilistic versions of some of the most paradigmatic combinatorial problems on graphs, such as the maximum independent set, the minimum vertex covering, the longest path and the minimum coloring.
Купить

Combinatorial Optimization

Автор: Korte
Название: Combinatorial Optimization
ISBN: 3540256849 ISBN-13(EAN): 9783540256847
Издательство: Springer
Цена: 3846 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.
Описание: This comprehensive textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It has arisen as the basis of several courses on combinatorial optimization and more special topics at graduate level. Since the complete book contains enough material for at least four semesters (4 hours a week), one usually selects material in a suitable way. The book contains complete but concise proofs, also for many deep results, some of which did not appear in a book before. Many very recent topics are covered as well, and many references are provided. Thus this book represents the state of the art of combinatorial optimization. This third edition contains a new chapter on facility location problems, an area which has been extremely active in the past few years. Furthermore there are several new sections and further material on various topics. New exercises and updates in the bibliography were added.From the reviews of the 2nd edition:"This book on combinatorial optimization is a beautiful example of the ideal textbook."Operations Resarch Letters 33 (2005), p.216-217"The second edition (with corrections and many updates) of this very recommendable book documents the relevant knowledge on combinatorial optimization and records those problems and algorithms that define this discipline today. To read this is very stimulating for all the researchers, practitioners, and students interested in combinatorial optimization."OR News 19 (2003), p.42 
Купить

Combinatorial Optimization -- Eureka, You Shrink! / Papers Dedicated to Jack Edmonds. 5th International Workshop, Aussois, France, March 5-9, 2001, Revised Papers

Автор: JГјnger Michael, Reinelt Gerhard, Rinaldi Giovanni
Название: Combinatorial Optimization -- Eureka, You Shrink! / Papers Dedicated to Jack Edmonds. 5th International Workshop, Aussois, France, March 5-9, 2001, Revised Papers
ISBN: 3540005803 ISBN-13(EAN): 9783540005803
Издательство: Springer
Цена: 3846 р.
Наличие на складе: Есть у поставщика.Поставка под заказ.
Купить

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


 
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
Visa, Master Card, Diners, AMEX, JCB, Web Money, Yandex Money Сбербанк онлайн