Combinatorial Optimisation.: Theory and Algorithms - Couverture rigide

Korte, Bernhard; Vygen, Jens

Couverture rigide

ISBN 10 : 3540672265 ISBN 13 : 9783540672265

Editeur : Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 2000

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.

A propos du livre

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.

Détails de l'édition

• Éditeur: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
• Date d'édition: 2000
• Langue: anglais
• ISBN 10: 3540672265
• ISBN 13: 9783540672265
• Reliure: Relié
• Nombre de pages: 580
• Coordonnées du fabricant: non disponible
• Personne responsable: CMN Printpool Inh. Mathis Neumann; https://www.also.com/ec/cms5/en_6000/6000/index.jsp; ; Friedrich-Karl-Str. 9; Hamburg; Allemagne