このページのリンク

Combinatorial Optimization : Theory and Algorithms.
(Algorithms and Combinatorics 21 ; 21)

データ種別 電子ブック
Third Edition
出版者 Berlin, Heidelberg : Springer Berlin Heidelberg
出版年 2006
本文言語 英語
大きさ XVI, 597 p : online resource

所蔵情報を非表示

URL 電子ブック


EB0119144

書誌詳細を非表示

内容注記 Graphs
Linear Programming
Linear Programming Algorithms
Integer Programming
Spanning Trees and Arborescences
Shortest Paths
Network Flows
Minimum Cost Flows
Maximum Matchings
Weighted Matching
b-Matchings and T-Joins
Matroids
Generalizations of Matroids
NP-Completeness
Approximation Algorithms
The Knapsack Problem
Bin-Packing
Multicommodity Flows and Edge-Disjoint Paths
Network Design Problems
The Traveling Salesman Problem
Facility Location
一般注記 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." OR News 19 (2003), p.42.
著者標目 SpringerLink (Online service)
件 名 LCSH:Mathematics
LCSH:Computer science -- Mathematics  全ての件名で検索
LCSH:Calculus of variations
LCSH:Combinatorics
FREE:Mathematics
FREE:Combinatorics
FREE:Calculus of Variations and Optimal Control; Optimization
FREE:Mathematics of Computing
分 類 DC23:511.6
巻冊次 ISBN:9783540292975 REFWLINK
ISBN 9783540292975
URL http://dx.doi.org/10.1007/3-540-29297-7
目次/あらすじ

 類似資料