Books in the Wiley Series in Discrete Mathematics and Optimization series

A remarkably accessible introduction to graph theory, assuming only undergraduate level linear algebra. Readers will get an excellent overview of the general principles while gaining an appreciation for the elegance and power of the subject matter.

This work covers the emerging distributional theory of sorting. It book opens with a chapter on the general area of complete and partial sorting. The following chapters discuss every standard sorting algorithm with a careful explanation of the mechanics of the algorithm both as code and verbally.

Providing the basic theory and methods that are essential for understanding complexity theory, this second edition of Theory of Computational Complexity emphasizes advances in the field of computational complexity, including newly developed algorithms and novel applications to quantum computing.

Wiley-Interscience Series in Discrete Mathematics and Optimization Advisory Editors: Ronald L. Graham, Jan Karel Lenstra, and Robert E. Tarjan Discrete mathematics, the study of finite structures, is one of the fastest-growing areas in mathematics.

Praise for the First Edition This excellent text should prove a useful accoutrement for any developing mathematics program... it s short, it s sweet, it s beautifully written. The Mathematical Intelligencer Erickson has prepared an exemplary work...

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.

This book introduces the reader to the fundamental principles, definitions, and results of dynamical systems and chaos. Rather than relegating chaos to the last chapter in the book, as is usually the case, this work treats chaos as an integral part of dynamical systems theory.

This invaluable resource presents the state of the art in discrete location theory.

A complete, self-contained introduction to a powerful and resurging mathematical discipline. Combinatorial Geometry presents and explains with complete proofs some of the most important results and methods of this relatively young mathematical discipline, started by Minkowski, Fejes Toth, Rogers, and Erd???s.

Unique in that it focuses on formulation and case studies rather than solutions procedures covering applications for pure, generalized and integer networks, equivalent formulations plus successful techniques of network models.

Logic has recently become a basic modelling tool alongside mathematics, and the two styles of modelling are beginning to combine. This volume exploits the similarity of certain logical and optimization problems to solve inference problems more rapidly than with traditional AI techniques.

Examining the role of logic in optimization as the theme for integration, this volume is designed for courses in optimization, in particular discrete optimization. Much of the emphasis is placed on corporate tools and techniques, including a wide range of programming options.

Updating and expanding upon the successful First Edition of Combinatorics, this new edition provides the foundation for mastering combinatorics. Blending an engaging style with mathematical rigor, Professor Merris provides a uniquely flexible tool for a wide variety of approaches to combinatorics.

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.

Since its beginnings in electrical engineering in 1948, the theory of error-correcting codes has evolved into mathematical topics with applications including communication systems, modern memory devices, computer systems, and high fidelity on compact disc players.

This book describes the theory and analysis of interior-point algorithms and the surge in research development over the last ten years. It derives various complexity results for linear and convex programming.

Written by a well-known and respected leader in the field, this work takes an intermediate approach to maxima, minima, and optimization, providing the science needed to understand the subject while presenting many practical applications and illustrations to support the concepts which are presented.

Contains a wealth of information previously scattered in research journals, conference proceedings and technical reports. Identifies more than 200 unsolved problems. Every problem is stated in a self-contained, extremely accessible format, followed by comments on its history, related results and literature.

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.

Discrete optimization models are used to tackle a wide variety of problems in many fields, including operations research, management science, engineering, and mathematics. Written by two internationally recognized integer programming experts, this book presents the mathematical foundations, theory, and algorithms of discrete optimization methods.

A unique interdisciplinary foundation for real-world problem solving Stochastic search and optimization techniques are used in a vast number of areas, including aerospace, medicine, transportation, and finance, to name but a few.