Описание: This tutorial introduces readers to several variants of routing problems with profits. In these routing problems each node has a certain profit, and not all nodes need to be visited. Since the orienteering problem (OP) is by far the most frequently studied problem in this category of routing problems, the book mainly focuses on the OP. In turn, other problems are presented as variants of the OP, focusing on the similarities and differences. The goal of the OP is to determine a subset of nodes to visit and in which order, so that the total collected profit is maximized and a given time budget is not exceeded.
The book provides a comprehensive review of variants of the OP, such as the team OP, the team OP with time windows, the profitable tour problem, and the prize-collecting travelling salesperson problem. In addition, it presents mathematical models and techniques for solving these OP variants and discusses their complexity. Several simple examples and benchmark instances, together with their best-known results, are also included. Finally, the book reviews the latest applications of these problems in the fields of logistics, tourism and others.
Автор: Alexander J. Zaslavski Название: Algorithms for solving common fixed point problems / ISBN: 3319774360 ISBN-13(EAN): 9783319774367 Издательство: Springer Рейтинг: Цена: 16769.00 р. Наличие на складе: Поставка под заказ.
Описание: This book details approximate solutions to common fixed point problems and convex feasibility problems in the presence of perturbations. Convex feasibility problems search for a common point of a finite collection of subsets in a Hilbert space; common fixed point problems pursue a common fixed point of a finite collection of self-mappings in a Hilbert space. A variety of algorithms are considered in this book for solving both types of problems, the study of which has fueled a rapidly growing area of research. This monograph is timely and highlights the numerous applications to engineering, computed tomography, and radiation therapy planning. Totaling eight chapters, this book begins with an introduction to foundational material and moves on to examine iterative methods in metric spaces. The dynamic string-averaging methods for common fixed point problems in normed space are analyzed in Chapter 3. Dynamic string methods, for common fixed point problems in a metric space are introduced and discussed in Chapter 4. Chapter 5 is devoted to the convergence of an abstract version of the algorithm which has been called component-averaged row projections (CARP). Chapter 6 studies a proximal algorithm for finding a common zero of a family of maximal monotone operators. Chapter 7 extends the results of Chapter 6 for a dynamic string-averaging version of the proximal algorithm. In Chapters 8 subgradient projections algorithms for convex feasibility problems are examined for infinite dimensional Hilbert spaces.
Автор: Alexander J. Zaslavski Название: Algorithms for Solving Common Fixed Point Problems ISBN: 3030084558 ISBN-13(EAN): 9783030084554 Издательство: Springer Рейтинг: Цена: 16769.00 р. Наличие на складе: Поставка под заказ.
Описание: This book details approximate solutions to common fixed point problems and convex feasibility problems in the presence of perturbations. common fixed point problems pursue a common fixed point of a finite collection of self-mappings in a Hilbert space.
Описание: This book provides state-of-the-art and interdisciplinary topics on solving matrix eigenvalue problems, particularly by using recent petascale and upcoming post-petascale supercomputers.
Автор: Ito Kazufumi, Jin Bangti Название: Inverse Problems: Tikhonov Theory and Algorithms ISBN: 9814596191 ISBN-13(EAN): 9789814596190 Издательство: World Scientific Publishing Рейтинг: Цена: 17741.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:
Inverse problems arise in practical applications whenever one needs to deduce unknowns from observables. This monograph is a valuable contribution to the highly topical field of computational inverse problems. Both mathematical theory and numerical algorithms for model-based inverse problems are discussed in detail. The mathematical theory focuses on nonsmooth Tikhonov regularization for linear and nonlinear inverse problems. The computational methods include nonsmooth optimization algorithms, direct inversion methods and uncertainty quantification via Bayesian inference.
The book offers a comprehensive treatment of modern techniques, and seamlessly blends regularization theory with computational methods, which is essential for developing accurate and efficient inversion algorithms for many practical inverse problems.
It demonstrates many current developments in the field of computational inversion, such as value function calculus, augmented Tikhonov regularization, multi-parameter Tikhonov regularization, semismooth Newton method, direct sampling method, uncertainty quantification and approximate Bayesian inference. It is written for graduate students and researchers in mathematics, natural science and engineering.
Автор: Kazimierz Malanowski; Koichi Mizukami Название: Analysis and Algorithms of Optimization Problems ISBN: 3540166602 ISBN-13(EAN): 9783540166603 Издательство: Springer Рейтинг: Цена: 12157.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book provides state-of-the-art and interdisciplinary topics on solving matrix eigenvalue problems, particularly by using recent petascale and upcoming post-petascale supercomputers.
Описание: This textbook offers an extensive list of completely solved problems in mathematical analysis. This first of three volumes covers sets, functions, limits, derivatives, integrals, sequences and series, to name a few. The series contains the material corresponding to the first three or four semesters of a course in Mathematical Analysis.
Based on the author's years of teaching experience, this work stands out by providing detailed solutions (often several pages long) to the problems. The basic premise of the book is that no topic should be left unexplained, and no question that could realistically arise while studying the solutions should remain unanswered. The style and format are straightforward and accessible.
In addition, each chapter includes exercises for students to work on independently. Answers are provided to all problems, allowing students to check their work. Though chiefly intended for early undergraduate students of Mathematics, Physics and Engineering, the book will also appeal to students from other areas with an interest in Mathematical Analysis, either as supplementary reading or for independent study.
Автор: Emilio Spedicato Название: Computer Algorithms for Solving Linear Algebraic Equations ISBN: 3642767192 ISBN-13(EAN): 9783642767197 Издательство: Springer Рейтинг: Цена: 14673.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Proceedings of the NATO Advanced Study Institute on Computer Algorithms for Solving Linear Equations: The State of the Art, held at Il Ciocco, Barga, Italy, September 9-21, 1990
Автор: Heinz H. Bauschke; Regina S. Burachik; Patrick L. Название: Fixed-Point Algorithms for Inverse Problems in Science and Engineering ISBN: 1461429005 ISBN-13(EAN): 9781461429005 Издательство: Springer Рейтинг: Цена: 23058.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book presents recent work from top-notch researchers studying projection and other first-order fixed-point algorithms in several areas of mathematics and the applied sciences. It provides a survey of the theory and practice in fixed-point algorithms.
Автор: Mari?n Vajtersic Название: Algorithms for Elliptic Problems ISBN: 9048141907 ISBN-13(EAN): 9789048141906 Издательство: Springer Рейтинг: Цена: 19564.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 'Et moi, ..., si j'avait su comment. One service mathematics has ren- en revenir, je n'y serais point alle'. dered the human race. It has put common sense back where it be- Jules Verne longs, on the topmost shelf next to the dusty canister labelIed 'discard- The series is divergent; therefore we ed nonsense'. may be able to do something with Eric T. Bell it. O. Heaviside Mathematics is a tool for thought. A highly necessary tool in a world where both feedback and nonlinearities abound. Similarly, all kinds of parts of mathematics serve as tools for other parts and for other sciences. Applying a simple rewriting rule to the quote on the right above one finds such statements as: 'One service topology has rendered mathema- tical physics ... '; 'One service logic has rendered computer science ... '; 'One service category theory has rendered mathematics ... '. All ar- guably true. Alld all statements obtainable this way form part of the raison d 'etre of this serics.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
