Combinatorial optimization theory algorithms de korte bernhard (35 resultados)

Hardcover. Condición: Good. X_Library copy with minimal use. No text marks. Minimal use or wear.

Hardcover. Condición: Good. X_Library copy with minimal use if any. No check out dates listed. Withdrawn April 2006. May be otherwise unused.

gebundene Ausgabe. Condición: Gut. 530 Seiten Der Erhaltungszustand des hier angebotenen Werks ist trotz seiner Bibliotheksnutzung sehr sauber und kann entsprechende Merkmale aufweisen (Rückenschild, Instituts-Stempel.). In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 830.

Condición: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

paperback. Condición: Acceptable. Connecting readers with great books since 1972. Used textbooks may not include companion materials such as access codes, etc. May have condition issues including wear and notes/highlighting. We ship orders daily and Customer Service is our top priority.

paperback. Condición: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.

Condición: Good. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Condición: New.

Condición: As New. Unread book in perfect condition.

Condición: As New. Unread book in perfect condition.

Condición: New.

Condición: New.

Condición: As New. Unread book in perfect condition.

Condición: New.

Condición: good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers.…

Condición: New.

Condición: New.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This comprehensive textbook on combinatorial optimization places specialemphasis on theoretical results and algorithms with provably goodperformance, 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 numerousexercises and references. This sixth edition has again been updated, revised, and significantly extended. Among other additions, there are new sections on shallow-light trees, submodular function maximization, smoothed analysis of the knapsack problem, the (ln 4+ )-approximation for Steiner trees, and the VPN theorem. Thus, this book continues torepresent the state of the art of combinatorial optimization.…

Condición: As New. Unread book in perfect condition.

Condición: New.

Condición: good. May show signs of wear, highlighting, writing, and previous use. This item may be a former library book with typical markings. No guarantee on products that contain supplements Your satisfaction is 100% guaranteed. Twenty-five year bookseller with shipments to over fifty million happy customers.…

Taschenbuch. Condición: Neu. Combinatorial Optimization | Theory and Algorithms | Bernhard Korte (u. a.) | Taschenbuch | Algorithms and Combinatorics | xxi | Englisch | 2019 | Springer | EAN 9783662585665 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …

Hardcover. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Buch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This comprehensive textbook on combinatorial optimization places specialemphasis on theoretical results and algorithms with provably goodperformance, 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 numerousexercises and references. This sixth edition has again been updated, revised, and significantly extended. Among other additions, there are new sections on shallow-light trees, submodular function maximization, smoothed analysis of the knapsack problem, the (ln 4+ )-approximation for Steiner trees, and the VPN theorem. Thus, this book continues torepresent the state of the art of combinatorial optimization.…

Condición: New. pp. 698.

Hardcover. Condición: Brand New. 6th edition. 698 pages. 9.25x6.25x1.75 inches. In Stock.

Paperback. Condición: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condición: very_good. This book is in Very good condition. There may be a few flaws like shelf wear and some light wear.

Couverture rigide. Condición: Très bon. 5ème Édition. Springer, Algorithmes and comnbinatorics (21), 2012. In-8, XIX+659pp. Plein cartonnage de l'éditeur. Fifth edition. Très bon état.

paperback. Condición: New. Paperback. Pub Date :2014-01-01 Pages: 541 Language: Chinese Publisher: Science Press Modern mathematics Renditions 23 Combinatorial Optimization: Theory and Algorithms systematic and comprehensive introduction to the basic theory and important combinatorial optimization algorithms. The book consists of 22 chapters. including both graph theory. linear and integer programming. and other basic parts of computational complexity. but also covers the classic results in several important combinator.…