Combinatorial Optimization: Theory and Algorithms

by Bernhard Korte, Jens Vygen

Now fully updated in a third edition, this is a comprehensive textbook on combinatorial optimization. It puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. The book contains complete but concise proofs, also for many deep results, some of which have not appeared in print before. Recent topics are covered as well, and numerous references are provided. 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.

Genres: Mathematics, Artificial Intelligence, Algorithms

645 pages, Paperback

First published April 29, 2002

About the author

Bernhard H. Korte was a German computer scientist, a professor at the University of Bonn, and an expert in combinatorial optimization.