Bernhard Korte: Combinatorial Optimization

Cover: 9783662585665 | Combinatorial Optimization | Theory and Algorithms | Korte (u. a.)

Rückseite: 9783662585665 | Combinatorial Optimization | Theory and Algorithms | Korte (u. a.)

Dekorationsartikel gehören nicht zum Leistungsumfang.

Sprache: Englisch

68,25 €

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 4-7 Werktage

Kategorien:

Beschreibung

Well-written, popular textbook on combinatorial optimization
One of very few textbooks on this topic
Subject area has manifold applications
Offers complete but concise proofs, making it an invaluable practical tool for students
Updated fifth edition

Über den Autor

Bernhard Korte is professor of operations research and director of the Research Institute for Discrete Mathematics at the University of Bonn. He founded the Arithmeum in Bonn and received numerous awards, including a honorary doctoral degree and the "Staatspreis NRW". His research interests include combinatorial optimization and chip design.
Jens Vygen is professor of discrete mathematics at the University of Bonn and principal investigator of the Hausdorff Center for Mathematics. He also co-authored the textbook "Algorithmic Mathematics" and has served as editor of several books and journals. His research interests include combinatorial optimization and algorithms for chip design.

Zusammenfassung

Well-written, popular textbook on combinatorial optimization

One of very few textbooks on this topic

Subject area has manifold applications

Offers complete but concise proofs, making it an invaluable practical tool for students

Updated fifth edition

Inhaltsverzeichnis

1 Introduction.- 2 Graphs.- 3 Linear Programming.- 4 Linear Programming Algorithms.- 5 Integer Programming.- 6 Spanning Trees and Arborescences.- 7 Shortest Paths.- 8 Network Flows.- 9 Minimum Cost Flows.- 10 Maximum Matchings.- 11 Weighted Matching.- 12
b
-Matchings and
T
-Joins.- 13 Matroids.- 14 Generalizations of Matroids.- 15
NP
-Completeness.- 16 Approximation Algorithms.- 17 The Knapsack Problem.- 18 Bin-Packing.- 19 Multicommodity Flows and Edge-Disjoint Paths.- 20 Network Design Problems.- 21 The Traveling Salesman Problem.- 22 Facility Location.- Indices.

Erscheinungsjahr:	2019
Fachbereich:	Allgemeines
Genre:	Mathematik , Medizin , Naturwissenschaften , Technik
Rubrik:	Naturwissenschaften & Technik
Medium:	Taschenbuch
Reihe:	Algorithms and Combinatorics
Inhalt:	xxi 698 S. 78 s/w Illustr. 698 p. 78 illus.
ISBN-13:	9783662585665
ISBN-10:	3662585669
Sprache:	Englisch
Einband:	Kartoniert / Broschiert
Autor:	Korte, Bernhard Vygen, Jens
Auflage:	Sixth Edition 2018
Hersteller:	Springer Springer-Verlag GmbH Algorithms and Combinatorics
Verantwortliche Person für die EU:	Springer Verlag GmbH, Tiergartenstr. 17, D-69121 Heidelberg, juergen.hartmann@springer.com
Maße:	235 x 155 x 39 mm
Von/Mit:	Bernhard Korte (u. a.)
Erscheinungsdatum:	11.01.2019
Gewicht:	1,072 kg