Combinatorial Optimization: Theory and Algorithms: v.21 (Algorithms and Combinatorics) - Hardcover

Korte, Bernhard; Vygen, Jens

Hardcover

ISBN 10: 3540256849 ISBN 13: 9783540256847

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

Über diesen Titel

Críticas

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

OR News 19 (2003), p.42

From the reviews of the third edition:

"In the last years Korte and J. Vygen’s ‘Combinational Optimization. Theory and Algorithms’ has become a standard textbook in the field. 5 years after the first edition ... the 3rd revised edition is available. ... several proofs have been streamlined, the references have been updated and new exercises have been added. That makes this volume to one of the most comprehensive and up-to-date textbooks in the field of combinatorial optimization."

Rainer E. Burkard, Zentralblatt MATH, Vol. 1099 (1), 2007

"This volume is an encyclopedic reference and textbook on theory and algorithms in combinatorial optimization. ... As befits a reference book, the references are very complete and up to date. ... The book has separate topic and author indexes and a very useful glossary of notation. ... The book ... will appeal primarily to readers who want an advanced textbook that can also serve as a concise reference. ... The current volume by Korte and Vygen is a worthy successor."

Brian Borchers, MathDL, May, 2006

Reseña del editor

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.

Details zur Ausgabe

• Verlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
• Erscheinungsdatum: 2005
• ISBN 10: 3540256849
• ISBN 13: 9783540256847
• Einband: Tapa dura
• Sprache: Englisch
• Auflage: 3
• Anzahl der Seiten: 613