楼主: nelsoncwlee
2492 12

[统计套利] Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics) [推广有奖]

  • 5关注
  • 82粉丝

学科带头人

62%

还不是VIP/贵宾

-

TA的文库  其他...

Financial Engineering

威望
1
论坛币
300418 个
通用积分
130.7746
学术水平
240 点
热心指数
288 点
信用等级
148 点
经验
240984 点
帖子
499
精华
0
在线时间
2716 小时
注册时间
2015-6-13
最后登录
2023-7-9

初级热心勋章 初级信用勋章 中级热心勋章

相似文件 换一批

+2 论坛币
k人 参与回答

经管之家送您一份

应届毕业生专属福利!

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

经管之家联合CDA

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

感谢您参与论坛问题回答

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

+2 论坛币

This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references.

This fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.

本帖隐藏的内容

Combinatorial Optimization - Theory And Algorithms - 4Th Edition - 2008.pdf (7.09 MB, 需要: 6 个论坛币)

Editorial ReviewsReviewFrom the reviews of the fifth edition:
“The book would be most suitable as a graduate text for a mathematics or computer science course. It offers a good number of exercises … . This book excels at providing very up-to-date results that give an idea of the state of the art, but also makes it clear that this is still a very active area of research. Overall, it is a comprehensive and interesting text that manages to present both the most classical and the most recent ideas in the field.” (Angele M. Hamel, ACM Computing Reviews, August, 2012)
“This is the 5th edition of one of the standard books in combinatorial optimization. It is an excellent book covering everything from the basics up to the most advanced topics (graduate level and current research). It provides theoretical results, underlying ideas, algorithms and the needed basics in graph theory in a very nice, comprehensive way.  … ‘Combinatorial Optimization’ can easily serve as … complete reference for current research and is state-of-the-art. In this new edition references have been updated and new exercises were added.” (Sebastian Pokutta, Zentralblatt MATH, Vol. 1237, 2012)


From the Back Cover

This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references.

This fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.

From the reviews of the previous editions:

"This book on combinatorial optimization is a beautiful example of the ideal textbook."

Operations Research Letters 33 (2005)

"..... this very recommendable book documents the relevant knowledge on combinatorial optimization and records those problems and algorithms that define this discipline today. To read this is very stimulating for all the researchers, practitioners, and students interested in combinatorial optimization."

OR News 19 (2003)

"... has become a standard textbook in the field."


Zentralblatt MATH 1099.90054

"...gives an excellent comprehensive view of the exciting field of combinatorial optimization."

Zentralblatt MATH 1149.90126


Product Details
  • Series: Algorithms and Combinatorics (Book 21)
  • Hardcover: 661 pages
  • Publisher: Springer; 5th ed. 2012 edition (January 13, 2012)
  • Language: English
  • ISBN-10: 3642244874
  • ISBN-13: 978-3642244872







二维码

扫码加我 拉你入群

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

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

关键词:Optimization Algorithms Algorithm Theory Optim

已有 2 人评分经验 论坛币 收起 理由
fantuanxiaot + 40 + 40 精彩帖子
lasgpope + 40 + 40 精彩帖子

总评分: 经验 + 80  论坛币 + 80   查看全部评分

本帖被以下文库推荐

沙发
Edwardu 发表于 2015-6-22 13:47:49 |只看作者 |坛友微信交流群
The book would be most suitable as a graduate text for a mathematics or computer science course.

使用道具

藤椅
liubingzsd 发表于 2015-6-22 16:35:19 |只看作者 |坛友微信交流群
谢谢!!!!!!!!!!!!!!

使用道具

板凳
dnq 发表于 2015-6-23 11:43:00 |只看作者 |坛友微信交流群
kankan

使用道具

报纸
cqiao 发表于 2015-6-23 22:46:42 |只看作者 |坛友微信交流群
谢谢分享

使用道具

地板
mike68097 发表于 2015-6-23 22:50:24 |只看作者 |坛友微信交流群

使用道具

7
teoks 发表于 2015-6-24 02:13:06 |只看作者 |坛友微信交流群
谢谢分享......

使用道具

8
云游天外 发表于 2015-6-29 23:27:57 |只看作者 |坛友微信交流群
感谢分享!

使用道具

9
sunhr1993 发表于 2015-7-4 22:16:46 |只看作者 |坛友微信交流群
不错~~~~~~

使用道具

10
duyang76 发表于 2015-7-5 04:06:24 |只看作者 |坛友微信交流群
谢谢分享,下来看看.顶!

使用道具

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

本版微信群
加好友,备注jr
拉您进交流群

京ICP备16021002-2号 京B2-20170662号 京公网安备 11010802022788号 论坛法律顾问:王进律师 知识产权保护声明   免责及隐私声明

GMT+8, 2024-4-28 15:40