Combinatorial optimization theory and algorithms Bernhard Korte, Jens Vygen. Algorithms and combinatorics 21/2.

Korte, Bernhard:

ISBN 10: 3540431543 / ISBN 13: 9783540431541

Editore: Berlin, Springer, 2002

Riguardo questo articolo

Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 90 KOR 9783540431541 Sprache: Englisch Gewicht in Gramm: 550.

Codice articolo 2501582

Dati bibliografici

• Titolo: Combinatorial optimization theory and algorithms Bernhard Korte, Jens Vygen. Algorithms and combinatorics 21/2.
• Editore: Berlin, Springer
• Data di pubblicazione: 2002
• Lingua: Inglese
• ISBN 10: 3540431543
• ISBN 13: 9783540431541
• Rilegatura: Hardcover
• Edizione: seconda edizione
• Peso: 550 grammi
• Cataloghi dei venditori:
  • SA MATHEMATIK

Descrizione articolo

Riassunto

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.From the reviews of the 2nd edition:"This book on combinatorial optimization is a beautiful example of the ideal textbook. [...] 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." J. Kohler, Halle an der SaaleELSEVIER Operations Rearch Letters, 2005, Issue 33.

Dalla quarta di copertina

Combinatorial optimization is one of the youngest and most active areas of discrete mathematics, and is probably its driving force today. This book describes the most important ideas, theoretical results, and algorithms of this field. It is conceived as an advanced graduate text, and it can also be used as an up-to-date reference work for current research. The book includes the essential fundamentals of graph theory, linear and integer programming, and complexity theory. It covers classical topics in combinatorial optimization as well as very recent ones. The emphasis is on theoretical results and algorithms with provably good performance. Some applications and heuristics are mentioned, too.