Combinatorial Optimization: Theory and Algorithms
Bernhard Korte, Jens Vygen
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.
الفئات:
عام:
2006
الإصدار:
3rd
الناشر:
Springer
اللغة:
english
الصفحات:
595
ISBN 10:
3540431543
ISBN 13:
9783540431541
سلسلة الكتب:
Algorithms and Combinatorics
ملف:
PDF, 2.31 MB
IPFS:
,
english, 2006
تنزيل هذا الكتاب غير متاح بسبب شكوى من صاحب حقوق النشر والطبع