Combinatorial Optimization: Theory and Algorithms by Bernhard Korte (English) Pa

Description: Combinatorial Optimization 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. Recent topics are covered as well, and numerous references are provided. FORMAT Paperback LANGUAGE English CONDITION Brand New Publisher Description 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. Notes 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. Back Cover This comprehensive textbook on combinatorial optimization places 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. It contains complete but concise proofs, also for many deep results, some of which did not appear in a textbook 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 fourth edition is again significantly extended, most notably with new material on linear programming, the network simplex algorithm, and the max-cut problem. Many further additions and updates are included as well. From the reviews of the previous editions: "This book on combinatorial optimization is a beautiful example of the ideal textbook." Operations Research Letters 33 (2005), p.216-217 "The second edition (with corrections and many updates) of this very recommendable book documents the relevant knowledge on combinatorial optimization and records those problems and algorithms that define this discipline today. To read this is very stimulating for all the researchers, practitioners, and students interested in combinatorial optimization." OR News 19 (2003), p.42 "... has become a standard textbook in the field." Zentralblatt MATH 1099.90054 Table of Contents Graphs.- Linear Programming.- Linear Programming Algorithms.- Integer Programming.- Spanning Trees and Arborescences.- Shortest Paths.- Network Flows.- Minimum Cost Flows.- Maximum Matchings.- Weighted Matching.- b-Matchings and T-Joins.- Matroids.- Generalizations of Matroids.- NP-Completeness.- Approximation Algorithms.- The Knapsack Problem.- Bin-Packing.- Multicommodity Flows and Edge-Disjoint Paths.- Network Design Problems.- The Traveling Salesman Problem.- Facility Location. Review From the reviews of the 2nd Edition:"Provides a useful collection of the major techniques, results and references in combinatorial optimization for researchers and teachers in the field."—MATHEMATICAL REVIEWS"This book on combinatorial optimization is a beautiful example of the ideal textbook."Operations Resarch Letters 33 (2005), p.216-217"The second edition (with corrections and many updates) of this very recommendable book documents the relevant knowledge on combinatorial optimization and records those problems and algorithms that define this discipline today. To read this is very stimulating for all the researchers, practitioners, and students interested in combinatorial optimization."OR News 19 (2003), p.42From the reviews of the third edition:"In the last years Korte and J. Vygens Combinational Optimization. Theory and Algorithms has become a standard textbook in the field. 5 years after the first edition … the 3rd revised edition is available. … several proofs have been streamlined, the references have been updated and new exercises have been added. That makes this volume to one of the most comprehensive and up-to-date textbooks in the field of combinatorial optimization." Rainer E. Burkard, Zentralblatt MATH, Vol. 1099 (1), 2007"This volume is an encyclopedic reference and textbook on theory and algorithms in combinatorial optimization. … As befits a reference book, the references are very complete and up to date. … The book has separate topic and author indexes and a very useful glossary of notation. … The book … will appeal primarily to readers who want an advanced textbook that can also serve as a concise reference. … The current volume by Korte and Vygen is a worthy successor." Brian Borchers, MathDL, May, 2006 Long Description With four English editions, and translations into four other languages forthcoming, we are very happy with the development of our book. Again, we have revised, updated, and signicantly extended it for this fourth edition. We have added some classical material that may have been missed so far, in particular on linear pro gramming, the network simplex algorithm, and the max cut problem. We have also added a number of new exercises and up to date references. We hope that these changes serve to make our book an even better basis for teaching and research. We gratefully acknowledge the continuous support of the Union of the Ger man Academies of Sciences and Humanities and the NRW Academy of Sciences via the long term research project "Discrete Mathematics and Its Applications". We also thank those who gave us feedback on the third edition, in particular Takao Asano, Christoph Bartoschek, Bert Besser, Ulrich Brenner, Jean Fonlupt, Satoru Fujishige, Marek Karpinski, Jens Ma Review Quote From the reviews of the 2nd Edition:"Provides a useful collection of the major techniques, results and references in combinatorial optimization for researchers and teachers in the field."-MATHEMATICAL REVIEWS"This book on combinatorial optimization is a beautiful example of the ideal textbook."Operations Resarch Letters 33 (2005), p.216-217"The second edition (with corrections and many updates) of this very recommendable book documents the relevant knowledge on combinatorial optimization and records those problems and algorithms that define this discipline today. To read this is very stimulating for all the researchers, practitioners, and students interested in combinatorial optimization."OR News 19 (2003), p.42From the reviews of the third edition:"In the last years Korte and J. Vygens Combinational Optimization. Theory and Algorithms has become a standard textbook in the field. 5 years after the first edition … the 3rd revised edition is available. … several proofs have been streamlined, the references have been updated and new exercises have been added. That makes this volume to one of the most comprehensive and up-to-date textbooks in the field of combinatorial optimization." Rainer E. Burkard, Zentralblatt MATH, Vol. 1099 (1), 2007"This volume is an encyclopedic reference and textbook on theory and algorithms in combinatorial optimization. … As befits a reference book, the references are very complete and up to date. … The book has separate topic and author indexes and a very useful glossary of notation. … The book … will appeal primarily to readers who want an advanced textbook that can also serve as a concise reference. … The current volume by Korte and Vygen is a worthy successor." Brian Borchers, MathDL, May, 2006 Feature Well-written textbook on combinatorial optimization One of very few textbooks on this topic Subject area has manifold applications Description for Sales People 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. Details ISBN3642090923 Author Jens Vygen Publisher Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Series Algorithms and Combinatorics Year 2010 Edition 4th ISBN-10 3642090923 ISBN-13 9783642090929 Format Paperback Imprint Springer-Verlag Berlin and Heidelberg GmbH & Co. K Place of Publication Berlin Country of Publication Germany DEWEY 519.6 Short Title COMBINATORIAL OPTIMIZATION 4/E Language English Media Book Series Number 21 Subtitle Theory and Algorithms Pages 627 Replaced by 9783642427671 DOI 10.1007/978-3-540-71844-4 UK Release Date 2010-11-11 Publication Date 2010-11-11 Edition Description Softcover reprint of hardcover 4th ed. 2008 Alternative 9783540718437 Audience Professional & Vocational Replaces 9783540256847 Illustrations 77 Illustrations, black and white; XVIII, 627 p. 77 illus. We've got this At The Nile, if you're looking for it, we've got it. With fast shipping, low prices, friendly service and well over a million items - you're bound to find what you want, at a price you'll love! TheNile_Item_ID:96271753;

Price: 182.19 AUD

Location: Melbourne

End Time: 2025-01-05T11:25:05.000Z

Shipping Cost: 15.89 AUD