Combinatorial Optimization and Graph Algorithms: Communications of Nii Shonan Meetings, Fukunaga Takuro, Kawarabayashi Ken-Ichi

Автор: Simon, Dan
Название: Evolutionary Optimization Algorithms
ISBN: 0470937416 ISBN-13(EAN): 9780470937419
Издательство: Wiley
Рейтинг:
Цена: 117160.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book is a clear and lucid presentation of Evolutionary Algorithms, with a straightforward, bottom-up approach that provides the reader with a firm grasp of the basic principles of EAs.

Автор: Hong Seok-Hee, Tokuyama Takeshi
Название: Beyond Planar Graphs: Communications of Nii Shonan Meetings
ISBN: 9811565325 ISBN-13(EAN): 9789811565328
Издательство: Springer
Рейтинг:
Цена: 93160.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: and 3) to foster cross-disciplinary research collaboration between computer science (graph drawing and computational geometry) and mathematics (graph theory and combinatorics). New algorithms for beyond planar graphs will be in high demand by practitioners in various application domains to solve complex visualization problems.

Автор: Takuro Fukunaga; Ken-ichi Kawarabayashi
Название: Combinatorial Optimization and Graph Algorithms
ISBN: 9811061467 ISBN-13(EAN): 9789811061462
Издательство: Springer
Рейтинг:
Цена: 102480.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.

Автор: Korte Bernhard, Vygen Jens
Название: Combinatorial Optimization: Theory and Algorithms
ISBN: 3662585669 ISBN-13(EAN): 9783662585665
Издательство: Springer
Рейтинг:
Цена: 60550.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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 sixth edition has again been updated, revised, and significantly extended. Among other additions, there are new sections on shallow-light trees, submodular function maximization, smoothed analysis of the knapsack problem, the (ln 4+?)-approximation for Steiner trees, and the VPN theorem. Thus, this book continues to represent the state of the art of combinatorial optimization.

Автор: David Avis; Alain Hertz; Odile Marcotte
Название: Graph Theory and Combinatorial Optimization
ISBN: 1441938117 ISBN-13(EAN): 9781441938114
Издательство: Springer
Рейтинг:
Цена: 102480.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.

Автор: Baker Kenneth R.
Название: Optimization Modeling with Spreadsheets
ISBN: 1118937694 ISBN-13(EAN): 9781118937693
Издательство: Wiley
Рейтинг:
Цена: 102380.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: An accessible introduction to optimization analysis using spreadsheets Updated and revised, Optimization Modeling with Spreadsheets, Third Edition emphasizes model building skills in optimization analysis.

Автор: Calafiore
Название: Optimization Models
ISBN: 1107050871 ISBN-13(EAN): 9781107050877
Издательство: Cambridge Academ
Рейтинг:
Цена: 69690.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Emphasizing practical understanding over the technicalities of specific algorithms, this elegant textbook teaches students how to recognize, simplify, model and solve optimization problems - and apply these basic principles to their own projects. Accompanied by an online solution manual, accessible only to instructors.

Автор: Alves Clбudio, Clautiaux Francois, Valйrio de Carvalho Josй
Название: Dual-Feasible Functions for Integer Programming and Combinatorial Optimization: Basics, Extensions and Applications
ISBN: 331980183X ISBN-13(EAN): 9783319801834
Издательство: Springer
Рейтинг:
Цена: 46570.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book provides a postgraduate audience the keys they need to understand and further develop a set of tools for the efficient computation of lower bounds and valid inequalities in integer programs and combinatorial optimization problems.

Автор: Liefooghe
Название: Evolutionary Computation in Combinatorial Optimization
ISBN: 3319774484 ISBN-13(EAN): 9783319774480
Издательство: Springer
Рейтинг:
Цена: 46570.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.

Автор: Mourad Ba?ou; Bernard Gendron; Oktay G?nl?k; A. Ri
Название: Combinatorial Optimization
ISBN: 3030532615 ISBN-13(EAN): 9783030532611
Издательство: Springer
Рейтинг:
Цена: 46570.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book constitutes the thoroughly refereed post-conference proceedings of the 6th International Symposium on Combinatorial Optimization, ISCO 2020, which was due to be held in Montreal, Canada, in May 2020.

Автор: Michael Z. Zgurovsky; Alexander A. Pavlov
Название: Combinatorial Optimization Problems in Planning and Decision Making
ISBN: 3030075524 ISBN-13(EAN): 9783030075521
Издательство: Springer
Рейтинг:
Цена: 158380.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The book focuses on the next fields of computer science: combinatorial optimization, scheduling theory, decision theory, and computer-aided production management systems. It also offers a quick introduction into the theory of PSC-algorithms, which are a new class of efficient methods for intractable problems of combinatorial optimization. A PSC-algorithm is an algorithm which includes: sufficient conditions of a feasible solution optimality for which their checking can be implemented only at the stage of a feasible solution construction, and this construction is carried out by a polynomial algorithm (the first polynomial component of the PSC-algorithm); an approximation algorithm with polynomial complexity (the second polynomial component of the PSC-algorithm); also, for NP-hard combinatorial optimization problems, an exact subalgorithm if sufficient conditions were found, fulfilment of which during the algorithm execution turns it into a polynomial complexity algorithm. Practitioners and software developers will find the book useful for implementing advanced methods of production organization in the fields of planning (including operative planning) and decision making. Scientists, graduate and master students, or system engineers who are interested in problems of combinatorial optimization, decision making with poorly formalized overall goals, or a multiple regression construction will benefit from this book.

Автор: Cl?udio Alves; Francois Clautiaux; Jos? Val?rio de
Название: Dual-Feasible Functions for Integer Programming and Combinatorial Optimization
ISBN: 3319276026 ISBN-13(EAN): 9783319276021
Издательство: Springer
Рейтинг:
Цена: 71730.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book provides a postgraduate audience the keys they need to understand and further develop a set of tools for the efficient computation of lower bounds and valid inequalities in integer programs and combinatorial optimization problems.