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