Combinatorial Optimization
Springer Berlin (Verlag)
978-3-642-09092-9 (ISBN)
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
Bernhard Korte ist Professor an der Universität Bonn und leitet seit 1987 das Forschungsinstitut für Diskrete Mathematik in Bonn. Er befasst sich vor allem mit kombinatorischer Optimierung. Im von ihm gegründeten Arithmeum in Bonn sind eine Vielzahl historischer Rechenmaschinen zu sehen. Bernhard Korte war Alexander von Humboldt Fellow. 1997 erhielt er den Staatspreis des Landes Nordrhein-Westfalen und 2002 das Große Bundesverdienstkreuz. Des weiteren ist er Träger des großen Verdienstordens der Republik Italien und Honorarprofessor der Academia Sinica in Peking und der PUC (päpstliche katholische Universität) in Rio de Janeiro. Er ist Ehrendoktor an der Universität La Sapienza in Rohm und Mitglied der Nationalen Akademie der Wissenschaften Leopoldina in Halle an der Saale, der Nordrhein-Westfälischen Akademie der Wissenschaften und der Künste in Düsseldorf und der Deutschen Akademie der Technikwissenschaften (acatech).
Jens Vygen ist Professor an der Universität Bonn. Seine Arbeitsgebiete sind kombinatorische Optimierung und Chip Design.
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.
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.42
From the reviews of the third edition:
"In the last years Korte and J. Vygen's '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
| Erscheint lt. Verlag | 11.11.2010 |
|---|---|
| Reihe/Serie | Algorithms and Combinatorics |
| Zusatzinfo | XVIII, 627 p. 77 illus. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 964 g |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik |
| Schlagworte | algorithms • combinatorial optimization • discrete algorithms • linear optimization • Mathematical Programming • Operations Research • Optimization |
| ISBN-10 | 3-642-09092-3 / 3642090923 |
| ISBN-13 | 978-3-642-09092-9 / 9783642090929 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
