Combinatorial Geometry

As we enter the new millennium, combinatorial chemistry is providing significant impetus to new innovations in synthetic chemistry. Combinatorial chemistry has rapidly become the rising star among research methods, allowing scientists to efficiently test the feasibility of a multitude of new compounds. The pursuit of new drugs is but one challenging field in which these combinatorial methods are particularly advantageous, helping researchers meet the modern-day demands of a highly competitive environment. This book emphasises that modern combinatorial synthesis is possible not only in the solid phase, but also in solutions. Moreover, it discusses computer-assisted methods as well as the apparatus and instrumentation required for the combinatorial method. Successful and experienced researchers in the leading pharmaceutical companies and most renowned research institutes offer a solid insight and perspective into this diverse field. A 'must' for every scientist in the area of pharmaceutical research

The story of success goes on and on – with a new book on combinatorial chemistry, edited by Gunther Jung! Combinatorial chemistry is a proven time- and resource-saving synthetic method of outstanding importance for industrial processes. Compound libraries help to save time and money, especially in the search for new drugs, and therefore play a pivotal role in solving the problem of the worldwide increasing demand for new and more active drugs. Not only substances, which are of interest for pharmaceutical chemistry, but also materials, catalysts, and biomolecules such as DNA or oligosaccharides are readily available with high structural diversities. The broad scope of combinatorial sciences is reflected by this book, edited by Gunther Jung: The synthetic methods discussed range from solid-phase to solution-phase synthesis, from preparations of small molecules such as amines or alcohols to those of complex biomolecules. Feasible methods, efficient techniques, new trends in automation, and state-of-the-art fast instrumental analytical and screening methods are presented with many practical tips and tricks for everybody working in combinatorial chemistry. This is the book written by specialists for specialists and for everyone aspiring to become an insider! It is an indispensible source of information for researchers working in organic synthesis, catalysis, biochemistry, and biotechnology, pharmaceutical and clinical chemistry, material sciences, and analytical chemistry.

A complete, highly accessible introduction to one of today's most exciting areas of applied mathematics One of the youngest, most vital areas of applied mathematics, combinatorial optimization integrates techniques from combinatorics, linear programming, and the theory of algorithms. Because of its success in solving difficult problems in areas from telecommunications to VLSI, from product distribution to airline crew scheduling, the field has seen a ground swell of activity over the past decade. Combinatorial Optimization is an ideal introduction to this mathematical discipline for advanced undergraduates and graduate students of discrete mathematics, computer science, and operations research. Written by a team of recognized experts, the text offers a thorough, highly accessible treatment of both classical concepts and recent results. The topics include: * Network flow problems * Optimal matching * Integrality of polyhedra * Matroids * NP-completeness Featuring logical and consistent exposition, clear explanations of basic and advanced concepts, many real-world examples, and helpful, skill-building exercises, Combinatorial Optimization is certain to become the standard text in the field for many years to come.

Includes proof of van der Waerden's 1926 conjecture on permanents, Wilson's theorem on asymptotic existence, and other developments in combinatorics since 1967. Also covers coding theory and its important connection with designs, problems of enumeration, and partition. Presents fundamentals in addition to latest advances, with illustrative problems at the end of each chapter. Enlarged appendixes include a longer list of block designs.

Combinatorial Materials Science describes new developments and research results in catalysts, biomaterials, and nanomaterials, together with informatics approaches to the analysis of Combinatorial Science (CombiSci) data. CombiSci has been used extensively in the pharmaceutical industry, but there is enormous potential in its application to materials design and characterization. Addressing advances and applications in both fields, Combinatorial Materials Science: Integrates the scientific fundamentals and interdisciplinary underpinnings required to develop and apply CombiSci concepts Discusses the development and use of CombiSci for the systematic and accelerated investigation of new phenomena and of the complex structure-function interplay in materials Covers the development of new library design strategies for materials processing and for high-throughput tools for rapid sampling Uses a unique, unified approach of applying combinatorial methods to unravel the non-linear structure-function relationships in diverse materials (both hard and soft), together with advances in informatics With chapters written by leading researchers in their specialty areas, this authoritative guide is a must-have resource for scientists and engineers in materials science research, biochemists, chemists, immunologists, cell biologists, polymer scientists, chemical and mechanical engineers, statisticians, and computer scientists. It is also a great text for graduate-level courses in materials science/engineering, polymer science, chemical engineering, and chemistry.

This text provides an excellent balance of theory and application that enables you to deploy powerful algorithms, frameworks, and methodologies to solve complex optimization problems in a diverse range of industries. Each chapter is written by leading experts in the fields of parallel and distributed optimization. Collectively, the contributions serve as a complete reference to the field of combinatorial optimization, including details and findings of recent and ongoing investigations.

Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aims to cover a wide range of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization. “Applications of Combinatorial Optimization” is presenting a certain number among the most common and well-known applications of Combinatorial Optimization.

Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aims to cover a wide range of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization. Concepts of Combinatorial Optimization, is divided into three parts: On the complexity of combinatorial optimization problems, that presents basics about worst-case and randomized complexity; Classical solution methods, that presents the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming; Elements from mathematical programming, that presents fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field.

Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aim to cover a wide range of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization. Concepts of Combinatorial Optimization, is divided into three parts: – On the complexity of combinatorial optimization problems, presenting basics about worst-case and randomized complexity; – Classical solution methods, presenting the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming; – Elements from mathematical programming, presenting fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field.

Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aim to cover a wide range of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization. Concepts of Combinatorial Optimization, is divided into three parts: – On the complexity of combinatorial optimization problems, presenting basics about worst-case and randomized complexity; – Classical solution methods, presenting the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming; – Elements from mathematical programming, presenting fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field.