Iterative Methods in Combinatorial Optimization
内容简介
With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying powe...
(展开全部)
With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms.
您对《Iterative Methods in Combinatorial Optimization》有什么评价吗,点击右上角“我想说两句”,说出你的看法吧。
有什么“读后感”吗?您可点击右上角“我要写长评”来进行评价噢。
猜您喜欢读
网友关注
网友关注
精品推荐
分类导航
评价“Iterative Methods in Combinatorial Optimization”