Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics) - Hardcover

Bernhard Korte

Hardcover

ISBN 10: 3540256849 ISBN 13: 9783540256847

Publisher: Springer, 2005

Synopsis

This well-written textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. The book contains complete (but concise) proofs, as well as many deep results, some of which have not appeared in any previous books.

About this title

From the Back Cover

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...

More

Review

From the reviews of the 2nd Edition:

"Provides a useful collection of the major techniques, results and references in combinatorial optimization for researchers and teachers in the field."—

MATHEMATICAL REVIEWS

"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...

More

Edition details

• Publisher: Springer
• Publication date: 2005
• ISBN 10: 3540256849
• ISBN 13: 9783540256847
• Binding: Hardcover
• Language: English
• Edition number: 3
• Number of pages: 597