-20%
Design and Applications of Nature Inspired Optimization: Contribution of Women Leaders in the Field
Price range: ₹7,329.00 through ₹9,831.00
This book gives a detailed information of various real-life applications from various fields using nature inspired optimization techniques. These techniques are proven to be efficient and robust in many difficult problems in literature.
-20%
Design and Applications of Nature Inspired Optimization: Contribution of Women Leaders in the Field
Price range: ₹7,329.00 through ₹9,831.00
This book gives a detailed information of various real-life applications from various fields using nature inspired optimization techniques. These techniques are proven to be efficient and robust in many difficult problems in literature.
-20%
Disjunctive Programming
Original price was: ₹13,851.00.₹11,082.00Current price is: ₹11,082.00.
Disjunctive Programming is a technique and a discipline initiated by the author in the early 1970's, which has become a central tool for solving nonconvex optimization problems like pure or mixed integer programs, through convexification (cutting plane) procedures combined with enumeration. It has played a major role in the revolution in the state of the art of Integer Programming that took place roughly during the period 1990-2010.
The main benefit that the reader may acquire from reading this book is a deeper understanding of the theoretical underpinnings and of the applications potential of disjunctive programming, which range from more efficient problem formulation to enhanced modeling capability and improved solution methods for integer and combinatorial optimization.
Egon Balas is University Professor and Lord Professor of Operations Research at Carnegie Mellon University's Tepper School of Business.
-20%
Disjunctive Programming
Original price was: ₹13,851.00.₹11,082.00Current price is: ₹11,082.00.
Disjunctive Programming is a technique and a discipline initiated by the author in the early 1970's, which has become a central tool for solving nonconvex optimization problems like pure or mixed integer programs, through convexification (cutting plane) procedures combined with enumeration. It has played a major role in the revolution in the state of the art of Integer Programming that took place roughly during the period 1990-2010.
The main benefit that the reader may acquire from reading this book is a deeper understanding of the theoretical underpinnings and of the applications potential of disjunctive programming, which range from more efficient problem formulation to enhanced modeling capability and improved solution methods for integer and combinatorial optimization.
Egon Balas is University Professor and Lord Professor of Operations Research at Carnegie Mellon University's Tepper School of Business.
-20%
Elements of the General Theory of Optimal Algorithms
Original price was: ₹13,851.00.₹11,082.00Current price is: ₹11,082.00.
In this monograph, the authors develop a methodology that allows one to construct and substantiate optimal and suboptimal algorithms to solve problems in computational and applied mathematics. Throughout the book, the authors explore well-known and proposed algorithms with a view toward analyzing their quality and the range of their efficiency. The concept of the approach taken is based on several theories (of computations, of optimal algorithms, of interpolation, interlination, and interflatation of functions, to name several). Theoretical principles and practical aspects of testing the quality of algorithms and applied software, are a major component of the exposition. The computer technology in construction of T-efficient algorithms for computing ε-solutions to problems of computational and applied mathematics, is also explored. The readership for this monograph is aimed at scientists, postgraduate students, advanced students, and specialists dealing with issues of developing algorithmic and software support for the solution of problems of computational and applied mathematics.
-20%
Elements of the General Theory of Optimal Algorithms
Original price was: ₹13,851.00.₹11,082.00Current price is: ₹11,082.00.
In this monograph, the authors develop a methodology that allows one to construct and substantiate optimal and suboptimal algorithms to solve problems in computational and applied mathematics. Throughout the book, the authors explore well-known and proposed algorithms with a view toward analyzing their quality and the range of their efficiency. The concept of the approach taken is based on several theories (of computations, of optimal algorithms, of interpolation, interlination, and interflatation of functions, to name several). Theoretical principles and practical aspects of testing the quality of algorithms and applied software, are a major component of the exposition. The computer technology in construction of T-efficient algorithms for computing ε-solutions to problems of computational and applied mathematics, is also explored. The readership for this monograph is aimed at scientists, postgraduate students, advanced students, and specialists dealing with issues of developing algorithmic and software support for the solution of problems of computational and applied mathematics.
-20%
Euclidean Distance Geometry: An Introduction
Original price was: ₹6,242.00.₹4,994.00Current price is: ₹4,994.00.
This textbook, the first of its kind, presents the fundamentals of distance geometry: theory, useful methodologies for obtaining solutions, and real world applications.
-20%
Euclidean Distance Geometry: An Introduction
Original price was: ₹6,242.00.₹4,994.00Current price is: ₹4,994.00.
This textbook, the first of its kind, presents the fundamentals of distance geometry: theory, useful methodologies for obtaining solutions, and real world applications.
-20%
Exact and Heuristic Methods in Combinatorial Optimization: A Study on the Linear Ordering and the Maximum Diversity Problem
Original price was: ₹12,809.00.₹10,248.00Current price is: ₹10,248.00.
In the last decades, algorithmic advances as well as hardware and software improvements have provided an excellent environment to create and develop solving methods to hard optimization problems. Modern exact and heuristic techniques are dramatically enhancing our ability to solve significant practical problems.
-20%
Exact and Heuristic Methods in Combinatorial Optimization: A Study on the Linear Ordering and the Maximum Diversity Problem
Original price was: ₹12,809.00.₹10,248.00Current price is: ₹10,248.00.
In the last decades, algorithmic advances as well as hardware and software improvements have provided an excellent environment to create and develop solving methods to hard optimization problems. Modern exact and heuristic techniques are dramatically enhancing our ability to solve significant practical problems.
-20%
Finitely Generated Abelian Groups and Similarity of Matrices over a Field
Original price was: ₹3,948.00.₹3,159.00Current price is: ₹3,159.00.
The theory of finitely generated abelian groups is introduced in an understandable and concrete way The analogous theory of similarity of square matrices over a field, including the Jordan form, is explained step by step Manipulative techniques are stressed to get students ‘on board’ Includes supplementary material: sn.pub/extras
-20%
Finitely Generated Abelian Groups and Similarity of Matrices over a Field
Original price was: ₹3,948.00.₹3,159.00Current price is: ₹3,159.00.
The theory of finitely generated abelian groups is introduced in an understandable and concrete way The analogous theory of similarity of square matrices over a field, including the Jordan form, is explained step by step Manipulative techniques are stressed to get students ‘on board’ Includes supplementary material: sn.pub/extras
-20%
Fractal Dimension for Fractal Structures: With Applications to Finance
Original price was: ₹10,724.00.₹8,580.00Current price is: ₹8,580.00.
This book provides a generalised approach to fractal dimension theory from the standpoint of asymmetric topology by employing the concept of a fractal structure. The fractal dimension is the main invariant of a fractal set, and provides useful information regarding the irregularities it presents when examined at a suitable level of detail. New theoretical models for calculating the fractal dimension of any subset with respect to a fractal structure are posed to generalise both the Hausdorff and box-counting dimensions. Some specific results for self-similar sets are also proved. Unlike classical fractal dimensions, these new models can be used with empirical applications of fractal dimension including non-Euclidean contexts.
In addition, the book applies these fractal dimensions to explore long-memory in financial markets. In particular, novel results linking both fractal dimension and the Hurst exponent are provided. As such, the book provides a number of algorithmsfor properly calculating the self-similarity exponent of a wide range of processes, including (fractional) Brownian motion and Lévy stable processes. The algorithms also make it possible to analyse long-memory in real stocks and international indexes.
This book is addressed to those researchers interested in fractal geometry, self-similarity patterns, and computational applications involving fractal dimension and Hurst exponent.
-20%
Fractal Dimension for Fractal Structures: With Applications to Finance
Original price was: ₹10,724.00.₹8,580.00Current price is: ₹8,580.00.
This book provides a generalised approach to fractal dimension theory from the standpoint of asymmetric topology by employing the concept of a fractal structure. The fractal dimension is the main invariant of a fractal set, and provides useful information regarding the irregularities it presents when examined at a suitable level of detail. New theoretical models for calculating the fractal dimension of any subset with respect to a fractal structure are posed to generalise both the Hausdorff and box-counting dimensions. Some specific results for self-similar sets are also proved. Unlike classical fractal dimensions, these new models can be used with empirical applications of fractal dimension including non-Euclidean contexts.
In addition, the book applies these fractal dimensions to explore long-memory in financial markets. In particular, novel results linking both fractal dimension and the Hurst exponent are provided. As such, the book provides a number of algorithmsfor properly calculating the self-similarity exponent of a wide range of processes, including (fractional) Brownian motion and Lévy stable processes. The algorithms also make it possible to analyse long-memory in real stocks and international indexes.
This book is addressed to those researchers interested in fractal geometry, self-similarity patterns, and computational applications involving fractal dimension and Hurst exponent.
-20%
Functional Analysis and Applications
Price range: ₹5,661.00 through ₹7,746.00
This self-contained textbook discusses all major topics in functional analysis. Combining classical materials with new methods, it supplies numerous relevant solved examples and problems and discusses the applications of functional analysis in diverse fields.
-20%
Functional Analysis and Applications
Price range: ₹5,661.00 through ₹7,746.00
This self-contained textbook discusses all major topics in functional analysis. Combining classical materials with new methods, it supplies numerous relevant solved examples and problems and discusses the applications of functional analysis in diverse fields.
-20%
Gems of Combinatorial Optimization and Graph Algorithms
Price range: ₹5,661.00 through ₹7,746.00
Gems of Combinatorial Optimization and Graph Algorithms is a handpicked collection of up-to-date articles, carefully prepared by a select group of international experts, who have contributed some of their most mathematically or algorithmically elegant ideas. Topics include longest tours and Steiner trees in geometric spaces, cartograms, resource buying games, congestion games, selfish routing, revenue equivalence and shortest paths, scheduling, linear structures in graphs, contraction hierarchies, budgeted matching problems, and motifs in networks.
-20%
Gems of Combinatorial Optimization and Graph Algorithms
Price range: ₹5,661.00 through ₹7,746.00
Gems of Combinatorial Optimization and Graph Algorithms is a handpicked collection of up-to-date articles, carefully prepared by a select group of international experts, who have contributed some of their most mathematically or algorithmically elegant ideas. Topics include longest tours and Steiner trees in geometric spaces, cartograms, resource buying games, congestion games, selfish routing, revenue equivalence and shortest paths, scheduling, linear structures in graphs, contraction hierarchies, budgeted matching problems, and motifs in networks.