Probability theory and combinatorial optimization

Main
Mathematics
Probability theory and combinatorial...

Probability theory and combinatorial optimization

Name: Probability theory and combinatorial optimization
ISBN: 9780898713800

J. Michael Steele

0 / 0

0 comments

你有多喜歡這本書？

文件的質量如何？

下載本書進行質量評估

下載文件的質量如何？

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.

類別:

Mathematics

年:

1987

版本:

illustrated edition

出版商:

Society for Industrial and Applied Mathematics

語言:

english

頁數:

162