Overview

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. This third edition contains a new chapter on facility location problems, an area which has been extremely active in the past few years. Furthermore there are several new sections and further material on various topics. New exercises and updates in the bibliography were added.From the reviews of the 2nd edition: This book on combinatorial optimization is a beautiful example of the ideal textbook. - Operations Resarch Letters 33 (2005), p.2 16-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.

Full Product Details

Author:   Bernhard Korte ,  Jens Vygen
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition:   3rd Revised edition
Volume:   v.21
Dimensions:   Width: 15.50cm , Height: 3.80cm , Length: 23.50cm
Weight:   1.052kg
ISBN:  

9783540256847

ISBN 10:   3540256849
Pages:   613
Publication Date:   01 September 2005
Audience:   Professional and scholarly ,  Professional & Vocational
Replaced By:   9783540718437
Format:   Hardback
Publisher's Status:   Active
Availability:   In Print  
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

Graphs.- Linear Programming.- Linear Programming Algorithms.- Integer Programming.- Spanning Trees and Arborescences.- Shortest Paths.- Network Flows.- Minimum Cost Flows.- Maximum Matchings.- Weighted Matching.- b-Matchings and T-Joins.- Matroids.- Generalizations of Matroids.- NP-Completeness.- Approximation Algorithms.- The Knapsack Problem.- Bin-Packing.- Multicommodity Flows and Edge-Disjoint Paths.- Network Design Problems.- The Traveling Salesman Problem.- Facility Location.

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

From the reviews of the 2nd Edition: <p> Provides a useful collection of the major techniques, results and references in combinatorial optimization for researchers and teachers in the field. a <p>MATHEMATICAL REVIEWS <p> This book on combinatorial optimization is a beautiful example of the ideal textbook. <p>Operations Resarch Letters 33 (2005), p.216-217 <p> 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. <p>OR News 19 (2003), p.42 <p>From the reviews of the third edition: <p> In the last years Korte and J. Vygena (TM)s a ~Combinational Optimization. Theory and Algorithmsa (TM) has become a standard textbook in the field. 5 years after the first edition a ] the 3rd revised edition is available. a ] 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. <p>Rainer E. Burkard, Zentralblatt MATH, Vol. 1099 (1), 2007 <p> This volume is an encyclopedic reference and textbook on theory and algorithms in combinatorial optimization. a ] As befits a reference book, the references are very complete and up to date. a ] The book has separate topic and author indexes and a very useful glossary of notation. a ] The book a ] will appeal primarily to readers who want an advanced textbook that can also serve as a concisereference. a ] The current volume by Korte and Vygen is a worthy successor. <p>Brian Borchers, MathDL, May, 2006

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions