Gems of Combinatorial Optimization and Graph Algorithms, Schulz Andreas S., Skutella Martin, Stiller Sebastian
Автор: Kochenderfer Mykel J., Wheeler Tim A. Название: Algorithms for Optimization ISBN: 0262039427 ISBN-13(EAN): 9780262039420 Издательство: MIT Press Рейтинг: Цена: 14390.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: A comprehensive introduction to optimization with a focus on practical algorithms for the design of engineering systems.
This book offers a comprehensive introduction to optimization with a focus on practical algorithms. The book approaches optimization from an engineering perspective, where the objective is to design a system that optimizes a set of metrics subject to constraints. Readers will learn about computational approaches for a range of challenges, including searching high-dimensional spaces, handling problems where there are multiple competing objectives, and accommodating uncertainty in the metrics. Figures, examples, and exercises convey the intuition behind the mathematical approaches. The text provides concrete implementations in the Julia programming language.
Topics covered include derivatives and their generalization to multiple dimensions; local descent and first- and second-order methods that inform local descent; stochastic methods, which introduce randomness into the optimization process; linear constrained optimization, when both the objective function and the constraints are linear; surrogate models, probabilistic surrogate models, and using probabilistic surrogate models to guide optimization; optimization under uncertainty; uncertainty propagation; expression optimization; and multidisciplinary design optimization. Appendixes offer an introduction to the Julia language, test functions for evaluating algorithm performance, and mathematical concepts used in the derivation and analysis of the optimization methods discussed in the text. The book can be used by advanced undergraduates and graduate students in mathematics, statistics, computer science, any engineering field, (including electrical engineering and aerospace engineering), and operations research, and as a reference for professionals.
Автор: David Avis; Alain Hertz; Odile Marcotte Название: Graph Theory and Combinatorial Optimization ISBN: 1441938117 ISBN-13(EAN): 9781441938114 Издательство: Springer Рейтинг: Цена: 15372.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Its techniques have been used in solving many classical problems including maximum flow problems, independent set problems, and the traveling salesman problem.Graph Theory and Combinatorial Optimization explores the field`s classical foundations and its developing theories, ideas and applications to new problems.
Автор: 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.
Автор: Agarwal, Dr Basant, Baka, Benjamin Название: Hands-On Data Structures and Algorithms with Python 2 ed ISBN: 1788995570 ISBN-13(EAN): 9781788995573 Издательство: Неизвестно Рейтинг: Цена: 8091.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Data structures help us to organize and align the data in a very efficient way. This book will surely help you to learn important and essential data structures through Python implementation for better understanding of the concepts.
Автор: Kocay William Название: Graphs, Algorithms, and Optimization ISBN: 1482251167 ISBN-13(EAN): 9781482251166 Издательство: Taylor&Francis Рейтинг: Цена: 12554.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
The second edition of this popular book presents the theory of graphs from an algorithmic viewpoint. The authors present the graph theory in a rigorous, but informal style and cover most of the main areas of graph theory. The ideas of surface topology are presented from an intuitive point of view. We have also included a discussion on linear programming that emphasizes problems in graph theory. The text is suitable for students in computer science or mathematics programs.
Автор: 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.
Автор: Takuro Fukunaga; Ken-ichi Kawarabayashi Название: Combinatorial Optimization and Graph Algorithms ISBN: 9811061467 ISBN-13(EAN): 9789811061462 Издательство: Springer Рейтинг: Цена: 15372.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Covering network designs, discrete convex analysis, facility location and clustering problems, matching games, and parameterized complexity, this book discusses theoretical aspects of combinatorial optimization and graph algorithms.
Описание: Covering network designs, discrete convex analysis, facility location and clustering problems, matching games, and parameterized complexity, this book discusses theoretical aspects of combinatorial optimization and graph algorithms.
Описание: 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.
Описание: Constitutes the joint refereed proceedings of the 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2008 and the 12th International Workshop on Randomization and Computation, RANDOM 2008, held in Boston, MA, USA, in August 2008. This book reviews 20 revised papers of the APPROX 2008 workshop.
Описание: These are the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
