Probability Theory and Combinatorial Optimization: Series Number 69 (CBMS-NSF Regional Conference Series in Applied Mathematics, Series Number 69) - Softcover

Steele, J. Michael

Softcover

ISBN 10: 0898713803 ISBN 13: 9780898713800

Publisher: Society for Industrial and Applied Mathematics, 1997

Synopsis

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.

About this title

Book Description

An introduction to the state of the art of the probability theory most 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.

Edition details

• Publisher: Society for Industrial and Applied Mathematics
• Publication date: 1997
• Language: English
• ISBN 10: 0898713803
• ISBN 13: 9780898713800
• Binding: Paperback
• Number of pages: 167