| 查看: 242 | 回复: 0 | |||
| 当前主题已经存档。 | |||
[资源]
【共享】【书籍】Combinatorial Optimization: Theory and Algorithms
|
|||
|
Combinatorial Optimization: Theory and Algorithms Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics) 3540256849, Pages: 597 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. Since the complete book contains enough material for at least four semesters (4 hours a week), one usually selects material in a suitable way. The book contains complete but concise proofs, also for many deep results, some of which did not appear in a book before. Many very recent topics are covered as well, and many references are provided. Thus this book represents the state of the art of combinatorial optimization. This third edition contains a new chapter on facility location problems, an area which has been extremely active in the past few years. Furthermore there are several new sections and further material on various topics. New exercises and updates in the bibliography were added. From the reviews of the 2nd edition: "This book on combinatorial optimization is a beautiful example of the ideal textbook." Operations Resarch Letters 33 (2005), p.216-217 "The second edition (with corrections and many updates) of 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. Table of Contents 1 Introduction 1 2 Graphs 13 3 Linear programming 49 4 Linear programming algorithms 65 5 Integer programming 91 6 Spanning trees and arborescences 119 7 Shortest paths 143 8 Network flows 157 9 Minimum cost flows 191 10 Maximum matchings 215 11 Weighted matching 245 12 B-matchings and T-joins 271 13 Matroids 291 14 Generalizations of matroids 323 15 NP-completeness 343 16 Approximation algorithms 377 17 The knapsack problem 415 18 Bin-packing 425 19 Multicommodity flows and edge-disjoint paths 443 20 Network design problems 467 21 The traveling salesman problem 501 22 Facility location 537 Download http://rapidshare.com/files/11149910/CoOp.rar.html http://www.bestsharing.com/files/s9zDhZR201784/CoOp.rar.html http://z31.zupload.com/download. ... &filepath=22224 |
回复此楼» 猜你喜欢
有多少人是今天查系统知道结果的？
已经有17人回复
-
我不理解！
已经有23人回复
-
2026年的国家社科基金项目通讯评审的新规则与新动向、新挑战
已经有10人回复
-
国自然面上复盘~欢迎讨论
已经有4人回复
-
系统查不到
已经有10人回复
-
基金不中，共勉
已经有3人回复
-
怎么查啊
已经有5人回复
-
范进中举一文的中心思想
已经有10人回复
-
2026国自然函评费到账
已经有25人回复
-
2026年8月25日国自然放榜前突然收到列入评审专家邮件，有关系吗？
已经有28人回复
投票:
