Series: Algorithms and Combinatorics , Vol. 21
Korte, Bernhard, Vygen, Jens
4th ed., 2008, XVIII, 627 p. 77 illus., Hardcover
ISBN: 978-3-540-71843-7

About this textbook
- Emphasizes theoretical results and algorithms with provably good performance
- Offers complete but concise proofs, making it an invaluable practical tool for students
- Fully updated third edition includes a new chapter on facility location problems
This fourth edition is again significantly extended, most notably with new material on linear programming, the network simplex algorithm, and the max-cut problem. Many further additions and updates are included as well.
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), 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
"... has become a standard textbook in the field."
Zentralblatt MATH 1099.90054
Written for:
Students in combinatorial optimization and operations research
Keywords:
- Combinatorial Optimization
- Combinatorial optimization
- Discrete Algorithms
- Mathematical Programming
- discrete algorithms
- mathematical programming


雷达卡



京公网安备 11010802022788号







