ENGLISH

Probability theory and combinatorial optimization

By J. Michael Steele

Book information

Publisher
Society for Industrial Mathematics
Year
1987
ISBN
9780898713800, 0898713803
LCC
QA273.45 .S74 1997
Open Library ID
OL1003234M
Language
english
Format
DJVU
Filesize
1 MB (1128459 bytes)
Series
CBMS-NSF Regional Conference Series in Applied Mathematics
Edition
illustrated edition
Pages
170\170
Time added
2009-08-06 05:14:26

Description

This monograph provides an introduction to the state of the art of the probability theory that is most directly applicable to combinatorial optimization. The questions that receive the most attention are those that deal with discrete optimization problems for points in Euclidean space, such as the minimum spanning tree, the traveling-salesman tour, and minimal-length matchings. Still, there are several nongeometric optimization problems that receive full treatment, and these include the problems of the longest common subsequence and the longest increasing subsequence. The philosophy that guides the exposition is that analysis of concrete problems is the most effective way to explain even the most general methods or abstract principles.

Similar books