Probability Theory and Combinatorial Optimization
J. Michael Steele
(Author)
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.
Product Details
Price
$61.59
Publisher
Society for Industrial and Applied Mathematics (SIAM)
Publish Date
January 01, 1987
Pages
167
Dimensions
0.0 X 0.0 X 0.0 inches | 0.0 pounds
Language
English
Type
Paperback
EAN/UPC
9780898713800
Earn by promoting books
Earn money by sharing your favorite books through our Affiliate program.
Become an affiliateAbout the Author
J. Michael Steele is C. F. Koo Professor of Statistics at Wharton School, University of Pennsylvania. He is the author of more than 100 mathematical publications including the books, Probability Theory and Combinatorial Optimization and Stochastic Calculus and Financial Applications. He is also the founding editor of the Annals of Applied Probability.