Combinatorial Optimization : Theory and Algorithms

Vygen, Jens, Korte, Barnhard

ISBN 10: 3540672265 / ISBN 13: 9783540672265

Edité par Springer, 2000

A propos de cet article

Former library book; may include library markings. Used book that is in clean, average condition without any missing pages.

N° de réf. du vendeur 16116829-6

Détails bibliographiques

• Titre: Combinatorial Optimization : Theory and Algorithms
• Éditeur: Springer
• Date de parution: 2000
• Langue: anglais
• ISBN à 10 chiffres: 3540672265
• ISBN à 13 chiffres: 9783540672265
• Reliure: Couverture rigide
• Édition: 1st Edition.
• État de l'article: Good

A propos de ce titre

Synopsis

This comprehensive textbook on combinatorial optimisation 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 optimisation 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 optimisation.

Présentation de l'éditeur

Now fully updated in a third edition, this is a comprehensive textbook on combinatorial optimization. It puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. Recent topics are covered as well, and numerous references are provided.