A Set of Examples of Global and Discrete Optimization, Jonas Mockus

Автор: Jonas Mockus
Название: A Set of Examples of Global and Discrete Optimization
ISBN: 1461371147 ISBN-13(EAN): 9781461371144
Издательство: Springer
Рейтинг:
Цена: 139750.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book shows how the Bayesian Approach (BA) improves well- known heuristics by randomizing and optimizing their parameters. A theoretical setting is described in which one can discuss a Bayesian adaptive choice of heuristics for discrete and global optimization prob- lems.

Автор: Z. Nahorski; H.F. Ravn; R.V.V. Vidal
Название: Optimization of Discrete Time Systems
ISBN: 3540122583 ISBN-13(EAN): 9783540122586
Издательство: Springer
Рейтинг:
Цена: 81050.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.

Автор: Svante Janson
Название: Random Graphs (Wiley Series in Discrete Mathematics and Optimization)
ISBN: 0471175412 ISBN-13(EAN): 9780471175414
Издательство: Wiley
Рейтинг:
Цена: 160460.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Since its inception in the 1960s, the theory of random graphs has evolved into a dynamic branch of discrete mathematics. Yet despite the lively activity and important applications, the last comprehensive volume on the subject is Bollobas`s well-known 1985 book.

Автор: Guy Cohen; Jean-Pierre Quadrat
Название: 11th International Conference on Analysis and Optimization of Systems: Discrete Event Systems
ISBN: 3540198962 ISBN-13(EAN): 9783540198963
Издательство: Springer
Рейтинг:
Цена: 81050.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The conference, coorganized by INRIA and Ecole des Mines de Paris, focuses on Discrete Event Systems (DES) and is aimed at engineers, scientists and mathematicians working in the fields of Automatic Control, Operations Research and Statistics who are interested in the modelling, analysis and optimization of DES.

Автор: Reiner Horst; Hoang Tuy
Название: Global Optimization
ISBN: 3642082475 ISBN-13(EAN): 9783642082474
Издательство: Springer
Рейтинг:
Цена: 306530.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Reiner Horst May 1992 Hoang Tuy PREFACE TO THE FIRST EDITION The enormous practical need for solving global optimization problems coupled with a rapidly advancing computer technology has allowed one to consider problems which a few years aga would have been considered computationally intractable.

Автор: Remigijus Paulavi?ius; Julius ?ilinskas
Название: Simplicial Global Optimization
ISBN: 1461490928 ISBN-13(EAN): 9781461490920
Издательство: Springer
Рейтинг:
Цена: 46570.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: A comparison of various Lipschitz bounds over simplices and an extension of Lipschitz global optimization with-out the Lipschitz constant to the case of simplicial partitioning is also depicted in this text.

Название: Combinatorial and global optimization
ISBN: 9810248024 ISBN-13(EAN): 9789810248024
Издательство: World Scientific Publishing
Рейтинг:
Цена: 100320.00 T
Наличие на складе: Поставка под заказ.
Описание: Combinatorial and global optimization problems appear in a wide range of applications in operations research, engineering, and biological and computer science. This is a selection of refereed papers based on talks presented at a conference on "Combinatorial and Global Optimization" held at Crete.

Автор: Giorgio Fasano
Название: Solving Non-standard Packing Problems by Global Optimization and Heuristics
ISBN: 3319050044 ISBN-13(EAN): 9783319050041
Издательство: Springer
Рейтинг:
Цена: 46570.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.

Автор: Korte, Bernhard, Vygen, Jens
Название: Combinatorial Optimization (algorithms and Combinatorics 21) 5th ed.
ISBN: 3642244874 ISBN-13(EAN): 9783642244872
Издательство: Springer
Рейтинг:
Цена: 60510.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 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.

Автор: J. Stoer
Название: Optimization Techniques II
ISBN: 3540087087 ISBN-13(EAN): 9783540087083
Издательство: Springer
Рейтинг:
Цена: 81050.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.

Автор: Manuel Laguna; Jos? Luis Gonz?lez-Velarde
Название: Computing Tools for Modeling, Optimization and Simulation
ISBN: 0792377184 ISBN-13(EAN): 9780792377184
Издательство: Springer
Рейтинг:
Цена: 194730.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Reflects the need for preserving the marriage between operations research and computing in order to create more efficient and powerful software tools. This book includes 17 papers that cover a range of topics related to the interface between operations research and computer science.

Автор: Vladimir Tsurkov
Название: Large-scale Optimization
ISBN: 0792368177 ISBN-13(EAN): 9780792368175
Издательство: Springer
Рейтинг:
Цена: 153720.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Decomposition methods aim to reduce large-scale problems to simpler problems. For fixed weights, successively simpler aggregated problems are solved and the convergence of their solution to that of the original problem is analyzed. Block problems in which the coupling variables do not enter the binding constraints are studied.