Parallel Scientific Computing and Optimization, Raimondas Ciegis; David Henty; Bo K?gstr?m; Julius
Автор: Sundaram, Rangarajan K. Название: A First Course in Optimization Theory ISBN: 0521497701 ISBN-13(EAN): 9780521497701 Издательство: Cambridge Academ Рейтинг: Цена: 6811.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book, first published in 1996, introduces students to optimization theory and its use in economics and allied disciplines.
Название: Network optimization problems : algorithms, applications and complexity ISBN: 9810212771 ISBN-13(EAN): 9789810212773 Издательство: World Scientific Publishing Рейтинг: Цена: 16188.00 р. 23126.00-30% Наличие на складе: Есть (1 шт.) Описание: The purpose of this book is to cover a spectrum of developments in network optimization problems, from linear networks to general nonconvex network flow problems.
Название: Complexity in numerical optimization ISBN: 9810214154 ISBN-13(EAN): 9789810214159 Издательство: World Scientific Publishing Рейтинг: Цена: 19325.00 р. Наличие на складе: Поставка под заказ.
Описание: A collection of articles on recent complexity developments in numerical optimization. The topics covered include complexity of approximation algorithms, new polynomial time algorithms for convex quadratic minimization and interior point algorithms.
Описание: Discrete event systems (DES) have become pervasive in our daily lives. Examples include (but are not restricted to) manufacturing and supply chains, transportation, healthcare, call centers, and financial engineering. However, due to their complexities that often involve millions or even billions of events with many variables and constraints, modeling these stochastic simulations has long been a "hard nut to crack." The advance in available computer technology, especially of cluster and cloud computing, has paved the way for the realization of a number of stochastic simulation optimization for complex discrete event systems. This book will introduce two important techniques initially proposed and developed by Professor Y C Ho and his team; namely perturbation analysis and ordinal optimization for stochastic simulation optimization, and present the state-of-the-art technology, and their future research directions.
Combinational optimization (CO) is a topic in applied mathematics, decision science and computer science that consists of finding the best solution from a non-exhaustive search. CO is related to disciplines such as computational complexity theory and algorithm theory, and has important applications in fields such as operations research/management science, artificial intelligence, machine learning, and software engineering.
Advances in Combinatorial Optimization presents a generalized framework for formulating hard combinatorial optimization problems (COPs) as polynomial sized linear programs. Though developed based on the 'traveling salesman problem' (TSP), the framework allows for the formulating of many of the well-known NP-Complete COPs directly (without the need to reduce them to other COPs) as linear programs, and demonstrates the same for three other problems (e.g. the 'vertex coloring problem' (VCP)). This work also represents a proof of the equality of the complexity classes "P" (polynomial time) and "NP" (nondeterministic polynomial time), and makes a contribution to the theory and application of 'extended formulations' (EFs).
On a whole, Advances in Combinatorial Optimization offers new modeling and solution perspectives which will be useful to professionals, graduate students and researchers who are either involved in routing, scheduling and sequencing decision-making in particular, or in dealing with the theory of computing in general.
Автор: Quarteroni Alfio Название: Scientific Computing with MATLAB and Octave ISBN: 3642124291 ISBN-13(EAN): 9783642124297 Издательство: Springer Рейтинг: Цена: 6981.00 р. Наличие на складе: Поставка под заказ.
Описание: Classical optimization methodologies fall short in very large and complex domains. In this book is suggested a different approach to optimization, an approach which is based on the 'blind' and heuristic mechanisms of evolution and population genetics. The genetic approach to optimization introduces a new philosophy to optimization in general, but particularly to engineering. By introducing the 'genetic' approach to robot trajectory generation, much can be learned about the adaptive mechanisms of evolution and how these mechanisms can solve real world problems. It is suggested further that optimization at large may benefit greatly from the adaptive optimization exhibited by natural systems when attempting to solve complex optimization problems, and that the determinism of classical optimization models may sometimes be an obstacle in nonlinear systems.This book is unique in that it reports in detail on an application of genetic algorithms to a real world problem, and explains the considerations taken during the development work. Futhermore, it addresses robotics in two new aspects: the optimization of the trajectory specification which has so far been done by human operators and has not received much attention for both automation and optimization, and the introduction of a heuristic strategy to a field predominated by deterministic strategies.Request Inspection Copy
Название: Combinatorial and global optimization ISBN: 9810248024 ISBN-13(EAN): 9789810248024 Издательство: World Scientific Publishing Рейтинг: Цена: 15048.00 р. Наличие на складе: Поставка под заказ.
Описание: 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.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
