Save 40% on select Business & Management books + FREE shipping or 50% on Physics eBooks!

Algorithms and Combinatorics

Combinatorial Optimization

Theory and Algorithms

Authors: Korte, Bernhard, Vygen, Jens

Free Preview
  • Well-written textbook on combinatorial optimization
  • One of very few textbooks on this topic
  • Subject area has manifold applications
see more benefits

Buy this book

eBook 67,82 €
price for Spain (gross)
  • ISBN 978-3-662-21708-5
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
About this Textbook

Combinatorial optimization is one of the youngest and most active areas of discrete mathematics, and is probably its driving force today. It became a subject in its own right about 50 years ago. This book describes the most important ideas, theoretical results, and algo­ rithms in combinatorial optimization. We have conceived it as an advanced gradu­ ate text which 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. Applications and heuristics are mentioned only occasionally. Combinatorial optimization has its roots in combinatorics, operations research, and theoretical computer science. A main motivation is that thousands of real-life problems can be formulated as abstract combinatorial optimization problems. We focus on the detailed study of classical problems which occur in many different contexts, together with the underlying theory. Most combinatorial optimization problems can be formulated naturally in terms of graphs and as (integer) linear programs. Therefore this book starts, after an introduction, by reviewing basic graph theory and proving those results in linear and integer programming which are most relevant for combinatorial optimization.

Reviews

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


Table of contents (21 chapters)

Table of contents (21 chapters)

Buy this book

eBook 67,82 €
price for Spain (gross)
  • ISBN 978-3-662-21708-5
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Combinatorial Optimization
Book Subtitle
Theory and Algorithms
Authors
Series Title
Algorithms and Combinatorics
Series Volume
21
Copyright
2000
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-662-21708-5
DOI
10.1007/978-3-662-21708-5
Series ISSN
0937-5511
Edition Number
1
Number of Pages
XI, 530
Topics