楼主: yiweidon
1961 2

Probability Theory and Combinatorial Optimization-J. Michael Steele [推广有奖]

已卖:32309份资源

学术权威

35%

还不是VIP/贵宾

-

TA的文库  其他...

My Life as a Quant

威望
1
论坛币
185275 个
通用积分
121.7774
学术水平
542 点
热心指数
705 点
信用等级
519 点
经验
169 点
帖子
7280
精华
6
在线时间
4265 小时
注册时间
2010-1-12
最后登录
2025-12-25

初级热心勋章 初级信用勋章 初级学术勋章 中级热心勋章 中级学术勋章 高级热心勋章

楼主
yiweidon 发表于 2011-4-13 11:12:38 |AI写论文

+2 论坛币
k人 参与回答

经管之家送您一份

应届毕业生专属福利!

求职就业群
赵安豆老师微信:zhaoandou666

经管之家联合CDA

送您一个全额奖学金名额~ !

感谢您参与论坛问题回答

经管之家送您两个论坛币!

+2 论坛币
[size=-1]Contents

Preface; Chapter 1: First View of Problems and Methods. A first example: Long common subsequences; Subadditivity and expected values; Azuma’s inequality and a first application; A second example: The increasing-subsequence problem; Flipping Azuma’s inequality; Concentration on rates; Dynamic programming; Kingman’s subadditive ergodic theorem; Observations on subadditive subsequences; Additional notes; Chapter 2: Concentration of Measure and the Classical Theorems. The TSP and quick application of Azuma’s inequality; Easy size bounds; Another mean Poissonization; The Beardwood-Halton-Hammersly theorem; Karp’s partitioning algorithms; Introduction to space-filling curve heuristic; Asymptotics for the space-filling curve heuristic; Additional notes; Chapter 3: More General Methods. Subadditive Euclidean functionals; Examples: Good, bad and forthcoming; A general L-(infinity) bound; Simple subadditivity and geometric subadditivity; A concentration inequality; Minimal matching; Two-sided bounds and first consequences; Rooted duals and their applications; Lower bounds and best possibilities; Additional remarks; Chapter 4: Probability in Greedy Algorithms and Linear Programming. Assignment problem; Simplex method for theoreticians; Dyer-Frieze-McDiarmid inequality; Dealing with integral constraints; Distributional bounds; Back to the future; Additional remarks; Chapter 5: Distributional Techniques and the Objective Method. Motivation for a method; Searching for a candidate object; Topology for nice sets; Information on the infinite tree; Dénoument; Central limit theory; Conditioning method for independence; Dependency graphs and the CLT; Additional remarks; Chapter 6: Talagrand’s Isoperimetric Theory. Talagrand’s isoperimetric theory; Two geometric applications of the isoperimetric inequality; Application to the longest-increasing-subsequence problem; Proof of the isoperimetric problem; Application and comparison in the theory of hereditary sets; Suprema of linear functionals; Tail of the assignment problem; Further applications of Talagrand’s isoperimetric inequalities; Final considerations on related work; Bibliography; Index.

1997 / viii + 159 pages / Softcover / ISBN-13: 978-0-898713-80-0 / ISBN-10: 0-89871-380-3 /
List Price $48.00 / SIAM/CBMS Member Price $33.60 / Order Code CB69
[size=-1]Price
二维码

扫码加我 拉你入群

请注明:姓名-公司-职位

以便审核进群资格,未注明则拒绝

关键词:Optimization Probability bability Ability Michael Probability Optimization Wharton

沙发
yiweidon(未真实交易用户) 发表于 2011-10-4 18:58:02
这是本好书啊,下载的人这么少
威廉姆,要向世界展示實用主義,進攻性及冷靜的計算相結合的無堅不摧的力量。

藤椅
Glorevo(真实交易用户) 发表于 2018-7-13 17:31:28
虽然只有162页,不过题材难得

您需要登录后才可以回帖 登录 | 我要注册

本版微信群
加好友,备注jr
拉您进交流群
GMT+8, 2026-1-3 02:44