Combinatorial optimization: theory and algorithms Korte, Bernhard

By:

Korte, Bernhard

Contributor(s):

Vygen, Jens

Material type: Text

TextSeries: Algorithms and Combinatorics 21Publication details: Heidelberg Springer 2012Edition: 5th edDescription: xix, 659 pISBN:

9783642244872

Subject(s):

Combinatorial optimization

DDC classification:

519.64 K6C6-2012

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

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Collection	Call number	Status	Date due	Barcode	Item holds
Book	Ahmedabad	Non-fiction	519.64 K6C6-2012 (Browse shelf(Opens below))	Available		180663

Total holds: 0

Browsing Ahmedabad shelves, Collection: Non-fiction Close shelf browser (Hides shelf browser)

					Next
	519.64 K6C6-2012 Combinatorial optimization: theory and algorithms	519.7 B3L4 Linear programming: active set analysis and computer programs	519.7 B8B2 Basic optimisation methods	519.7 D3D9 Dynamic programming: models and applications	Next

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.

There are no comments on this title.

to post a comment.