Authors:
- Well-written textbook on combinatorial optimization
- One of very few textbooks on this topic
- Subject area has manifold applications
- Includes supplementary material: sn.pub/extras
Part of the book series: Algorithms and Combinatorics (AC, volume 21)
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (21 chapters)
-
Front Matter
About this book
Reviews
“This book describes the most important ideas, theoretical results, algorithms in combinatorial optimization and covers an advanced graduate text which can also be used as an up-to-date reference work for current research. … At the end of each chapter there are a number of exercises containing additional results and applications of the material in that chapter. Each chapter ends with a list of references, incuding texts recommended for further study.” (J.Fiamčik, zbMATH 0953.90052, 2022)
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
Authors and Affiliations
-
Research Institute for Discrete Mathematics, University of Bonn, Bonn, Germany
Bernhard Korte, Jens Vygen
Bibliographic Information
Book Title: Combinatorial Optimization
Book Subtitle: Theory and Algorithms
Authors: Bernhard Korte, Jens Vygen
Series Title: Algorithms and Combinatorics
DOI: https://doi.org/10.1007/978-3-662-21708-5
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 2000
eBook ISBN: 978-3-662-21708-5Published: 29 June 2013
Series ISSN: 0937-5511
Series E-ISSN: 2197-6783
Edition Number: 1
Number of Pages: XI, 530
Topics: Combinatorics, Calculus of Variations and Optimal Control; Optimization, Mathematics of Computing