Modern applied mathematics: Optimization and operations research : collection of state-of-the-art surveys based on lectures presented at the summer ... the University of Bonn, September 14-22, 1979

Science & Math

Bernhard Korte

Mathematics

North-Holland

This well-written textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. The book contains complete (but concise) proofs, as well as many deep results, some of which have not appeared in any previous books.

Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)

Computers & Technology

Computer Science

Springer

This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. 
This fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.

This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.

See the best price to sell, buy, or rent books by Bernhard Korte. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Books by Bernhard Korte

See the best price to sell, buy, or rent books by Bernhard Korte. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Modern applied mathematics: Optimization and operations research : collection of state-of-the-art surveys based on lectures presented at the summer ... the University of Bonn, September 14-22, 1979

Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)

Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)

Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)