Search Problems (Wiley Series in Discrete Mathematics and Optimization)

✍ Scribed by Rudolf Ahlswede, Ingo Wegener

Publisher: John Wiley & Sons
Year: 1987
Tongue: English
Leaves: 296
Series: Wiley Series in Discrete Mathematics and Optimization
Edition: 1
Category: Library

No coin nor oath required. For personal study only.

✦ Synopsis

The problems of search, exploration, discovery, and identification are of key importance in a wide variety of applications, including engineering, computer science, economics, and information theory. Over the past 30 years a great deal of work has been done on search problems by scientists from several disciplines. This book brings together the results from a number of different fields to provide the first really comprehensive overview of the subject. Major emphasis is placed on applications in science and mathematics. Presents open problems and contains many suggestions for further reading.

📜 SIMILAR VOLUMES

Search Problems (Wiley Series in Discret

📁 Search Problems (Wiley Series in Discrete Mathematics and Optimization)

✍ Rudolf Ahlswede, Ingo Wegener 📂 Library 📅 1987 🏛 John Wiley & Sons 🌐 English

Search Problems (Wiley Interscience Seri

📁 Search Problems (Wiley Interscience Series in Discrete Mathematics)

✍ Rudolf Ahlswede 📂 Library 📅 1987 🏛 John Wiley & Sons Inc 🌐 English

The problems of search, exploration, discovery and identification are of key importance in a wide variety of applications. This book provides a comprehensive survey of the substantial contributions made to these problems by researchers in the last 30 years. The authors emphasise connections to other

Combinatorics (Wiley Series in Discrete

📁 Combinatorics (Wiley Series in Discrete Mathematics and Optimization)

✍ Russell Merris 📂 Library 📅 2003 🏛 Wiley-Interscience 🌐 English

There is no question that combinatorics is becoming more important in the practice of computer science. While some of the most important techniques are covered in discrete mathematics courses, there is not enough breadth or depth in the coverage. As a consequence, one of my goals this upcoming year

Integer and Combinatorial Optimization (

📁 Integer and Combinatorial Optimization (Wiley Series in Discrete Mathematics and Optimization)

✍ Laurence A. Wolsey, George L. Nemhauser 📂 Library 📅 1988 🏛 Wiley-Interscience 🌐 English

<span>Rave reviews for INTEGER AND COMBINATORIAL OPTIMIZATION<br> <br> "This book provides an excellent introduction and survey of traditional fields of combinatorial optimization . . . It is indeed one of the best and most complete texts on combinatorial optimization . . . available. [And] with mor

Combinatorics (Wiley-Interscience Series

📁 Combinatorics (Wiley-Interscience Series in Discrete Mathematics and Optimization)

✍ Russell Merris 📂 Library 📅 2003 🌐 English

A mathematical gem–freshly cleaned and polishedThis book is intended to be used as the text for a first course in combinatorics. the text has been shaped by two goals, namely, to make complex mathematics accessible to students with a wide range of abilities, interests, and motivations; and to create

Graph Theory (Wiley Series in Discrete M

📁 Graph Theory (Wiley Series in Discrete Mathematics and Optimization)

✍ Russell Merris 📂 Library 📅 2000 🏛 Wiley-Interscience 🌐 English

A lively invitation to the flavor, elegance, and power of graph theoryThis 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 designe