The first comprehensive review of the theory and practice of one of today's most powerful optimization techniques.

The explosive growth of research into and development of interior point algorithms over the past two decades has significantly improved the complexity of linear programming and yielded some of today's most sophisticated computing techniques. This book offers a comprehensive and thorough treatment of the theory, analysis, and implementation of this powerful computational tool.

Interior Point Algorithms provides detailed coverage of all basic and advanced...

A unified, modern treatment of the theory of random graphs-including recent results and techniques
Since its inception in the 1960s, the theory of random graphs has evolved into a dynamic branch of discrete mathematics. Yet despite the lively activity and important applications, the last comprehensive volume on the subject is Bollobas's well-known 1985 book. Poised to stimulate research for years to come, this new work covers developments of the last decade, providing a much-needed, modern overview of this fast-growing area of combinatorics. Written by three highly respected members of...

An introduction to the theory of error-correction codes, and in particular to linear block codes is provided in this book. It considers such codes as Hamming codes and Golay codes, correction of double errors, use of finite fields, cyclic codes, BCH codes and weight distributions, as well as design of codes.

A timely book on a topic that has witnessed a surge of interest over the last decade, owing in part to several novel applications, most notably in data compression and computational molecular biology. It describes methods employed in average case analysis of algorithms, combining both analytical and probabilistic tools in a single volume.
* Tools are illustrated through problems on words with applications to molecular biology, data compression, security, and pattern matching.
* Includes chapters on algorithms and data structures on words, probabilistic and analytical models,...

Maximum and minimum problems are of daily concern in industry and government operations. These problems are the foundation of optimisation, determining the best manner in which to organise or produce items. By optimising a procedure, costs can be significantly lowered and the waste of materials can be reduced.

A timely, accessible introduction to the mathematics of chaos.

The past three decades have seen dramatic developments in the theory of dynamical systems, particularly regarding the exploration of chaotic behavior. Complex patterns of even simple processes arising in biology, chemistry, physics, engineering, economics, and a host of other disciplines have been investigated, explained, and utilized.

Introduction to Discrete Dynamical Systems and Chaos makes these exciting and important ideas accessible to students and scientists by assuming, as a background, only the...

A pioneering look at the fundamental role of logic in optimization and constraint satisfaction
While recent efforts to combine optimization and constraint satisfaction have received considerable attention, little has been said about using logic in optimization as the key to unifying the two fields. Logic-Based Methods for Optimization develops for the first time a comprehensive conceptual framework for integrating optimization and constraint satisfaction, then goes a step further and shows how extending logical inference to optimization allows for more powerful as well as flexible...

A lively invitation to the flavor, elegance, and power of graph theory

This mathematically rigorous introduction is tempered and enlivened by numerous illustrations, revealing examples, seductive applications, and historical references. An award-winning teacher, Russ Merris has crafted a book designed to attract and engage through its spirited exposition, a rich assortment of well-chosen exercises, and a selection of topics that emphasizes the kinds of things that can be manipulated, counted, and pictured. Intended neither to be a comprehensive overview nor an encyclopedic...

Praise for the First Edition

"Anyone interested in getting an introduction to Ramsey theory will find this illuminating..."
--MAA Reviews

Covering all the major concepts, proofs, and theorems, the Second Edition of Ramsey Theory is the ultimate guide to understanding every aspect of Shelah's proof, as well as the original proof of van der Waerden. The book offers a historical perspective of Ramsey's fundamental paper from 1930 and Erdos' and Szekeres' article from 1935, while placing the various theorems in the context of T. S....

Following a brief introduction to combinatorial design theory, in which the authors standardize notation, this volume contains a series of detailed surveys which examine specific areas of design theory. Papers are included which provide updates to earlier surveys.