๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Probability theory and combinatorial optimization

โœ Scribed by J. Michael Steele


Publisher
Society for Industrial and Applied Mathematics
Year
1987
Tongue
English
Leaves
170
Series
CBMS-NSF regional conference series in applied mathematics 69
Edition
illustrated edition
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis


My special field is neither statistics nor math. My reading this book was for research purpose. I enjoyed reading it, though it contains a few of "printing" mistakes.

The chapter 6 is somehow hard-to-find. I believe Talagrand's isoperimetric theory has wide range of applications. But it is not easy to read his original article (which, besides, is more than 100-page long). The chapter gives a very informative introduction to the theory.


๐Ÿ“œ SIMILAR VOLUMES


Probability Theory and Combinatorial Opt
โœ J. Michael Steele ๐Ÿ“‚ Library ๐Ÿ“… 1997 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English

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 m

Probability Theory and Combinatorial Opt
โœ J. Michael Steele ๐Ÿ“‚ Library ๐Ÿ“… 1997 ๐Ÿ› Society for Industrial Mathematics ๐ŸŒ English

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 m

Probability theory and combinatorial opt
โœ J Michael Steele ๐Ÿ“‚ Library ๐Ÿ“… 1997 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English

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 m