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

Probability theory and combinatorial optimization

โœ Scribed by J. Michael Steele

Book ID
127455520
Publisher
Society for Industrial and Applied Mathematics
Year
1997
Tongue
English
Weight
1 MB
Series
CBMS-NSF regional conference series in applied mathematics 69
Edition
illustrated edition
Category
Library
City
Philadelphia
ISBN
0898713803

No coin nor oath required. For personal study only.

โœฆ 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.

๐Ÿ“œ SIMILAR VOLUMES

Probability theory and combinatorial opt
Probability theory and combinatorial optimization
โœ J. Michael Steele ๐Ÿ“‚ Library ๐Ÿ“… 1987 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 2 MB

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

Combinatorial Optimization. Theory and A
Combinatorial Optimization. Theory and Algorithms
โœ Bernhard Korte, Jens Vygen ๐Ÿ“‚ Library ๐Ÿ“… 2002 ๐Ÿ› Springer ๐ŸŒ English โš– 2 MB

This comprehensive textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It has arisen as the basis of several courses on combinatorial optimization and more special topics at graduate level. Sin

Combinatorial Optimization: Theory and A
Combinatorial Optimization: Theory and Algorithms
โœ Bernhard Korte, Jens Vygen (auth.) ๐Ÿ“‚ Library ๐Ÿ“… 2008 ๐Ÿ› Springer ๐ŸŒ English โš– 7 MB

This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It has arisen as the basis of several courses on combinatorial optimization and more special topics at graduate level. It