Seems you have not registered as a member of localhost.saystem.shop!
You may have to register before you can download all our books and magazines, click the sign up button below to create a free account.
Quadratic Assignment and Related Problems
The methods described here include eigenvalue estimates and reduction techniques for lower bounds, parallelization, genetic algorithms, polyhedral approaches, greedy and adaptive search algorithms.
Handbook of combinatorial optimization
This is the second of a multi-volume set. The various volumes deal with several algorithmic approaches for discrete problems as well as with many combinatorial problems. The emphasis is on late-1990s developments. Each chapter is essentially expository in nature, but scholarly in its treatment.
Vertex Operator Algebras in Mathematics and Physics
Vertex operator algebras are a class of algebras underlying a number of recent constructions, results, and themes in mathematics. These algebras can be understood as ''string-theoretic analogues'' of Lie algebras and of commutative associative algebras. They play fundamental roles in some of the most active research areas in mathematics and physics. Much recent progress in both physics and mathematics has benefited from cross-pollination between the physical and mathematical points of view. This book presents the proceedings from the workshop, ''Vertex Operator Algebras in Mathematics and Physics'', held at The Fields Institute. It consists of papers based on many of the talks given at the conference by leading experts in the algebraic, geometric, and physical aspects of vertex operator algebra theory. The book is suitable for graduate students and research mathematicians interested in the major themes and important developments on the frontier of research in vertex operator algebra theory and its applications in mathematics and physics.
Parallel Processing of Discrete Optimization Problems
This book contains papers presented at the Workshop on Parallel Processing of Discrete Optimization Problems held at DIMACS in April 1994. The contents cover a wide spectrum of the most recent algorithms and applications in parallel processing of discrete optimization and related problems. Topics include parallel branch and bound algorithms, scalability, load balancing, parallelism and irregular data structures and scheduling task graphs on parallel machines. Applications include parallel algorithms for solving satisfiability problems, location problems, linear programming, quadratic and linear assignment problems. This book would be suitable as a textbook in advanced courses on parallel algorithms and combinatorial optimization.
Representations of Finite Dimensional Algebras and Related Topics in Lie Theory and Geometry
These proceedings are from the Tenth International Conference on Representations of Algebras and Related Topics (ICRA X) held at The Fields Institute. In addition to the traditional ``instructional'' workshop preceding the conference, there were also workshops on ``Commutative Algebra, Algebraic Geometry and Representation Theory'', ``Finite Dimensional Algebras, Algebraic Groups and Lie Theory'', and ``Quantum Groups and Hall Algebras''. These workshops reflect the latest developments and the increasing interest in areas that are closely related to the representation theory of finite dimensional associative algebras. Although these workshops were organized separately, their topics are stron...
Handbook of Combinatorial Optimization
Combinatorial (or discrete) optimization is one of the most active fields in the interface of operations research, computer science, and applied math ematics. Combinatorial optimization problems arise in various applications, including communications network design, VLSI design, machine vision, air line crew scheduling, corporate planning, computer-aided design and man ufacturing, database query design, cellular telephone frequency assignment, constraint directed reasoning, and computational biology. Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory. All these problems,...
Proof Complexity and Feasible Arithmetics
The 16 papers reflect some of the breakthroughs over the past dozen years in understanding whether or not logical inferences can be made in certain situations and what resources are necessary to make such inferences, questions that play a large role in computer science and artificial intelligence. They discuss such aspects as lower bounds in proof complexity, witnessing theorems and proof systems for feasible arithmetic, algebraic and combinatorial proof systems, and the relationship between proof complexity and Boolean circuit complexity. No index. Member prices are $47 for institutions and $35 for individuals. Annotation copyrighted by Book News, Inc., Portland, OR.
Applications of Multi-objective Evolutionary Algorithms
- Detailed MOEA applications discussed by international experts - State-of-the-art practical insights in tackling statistical optimization with MOEAs - A unique monograph covering a wide spectrum of real-world applications - Step-by-step discussion of MOEA applications in a variety of domains
Graphs, Morphisms and Statistical Physics
Based on a March 2001 workshop, this collection explores connections between random graphs and percolation, between slow mixing and phase transition, and between graph morphisms and hard-constraint models. Topics of the 14 papers include efficient local search near phase transitions in combinatorial optimization, graph homomorphisms and long range action, recent results on parameterized H-colorings, the satisfiability of random k-Horn formulae, a discrete non-Pfaffian approach to the Ising problem, and chromatic numbers of products of tournaments. No indexes are provided. Annotation : 2004 Book News, Inc., Portland, OR (booknews.com).
