Combinatorial Optimization: Theory and Algorithms
Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Korte, Bernhard (VerfasserIn)
Format: Elektronisch E-Book
Sprache:English
Veröffentlicht: Berlin, Heidelberg Springer Berlin Heidelberg 2002
Ausgabe:Second Edition
Schriftenreihe:Algorithms and Combinatorics 21
Schlagworte:
Online-Zugang:Volltext
Beschreibung:Combinatorial optimization is one of the youngest and most active areas of discrete mathematics, and is probably its driving force today. This book describes the most important ideas, theoretical results, and algorithms of this field. It is conceived as an advanced graduate text, and it can also be used as an up-to-date reference work for current research. The book includes the essential fundamentals of graph theory, linear and integer programming, and complexity theory. It covers classical topics in combinatorial optimization as well as very recent ones. The emphasis is on theoretical results and algorithms with provably good performance. Some applications and heuristics are mentioned, too
Beschreibung:1 Online-Ressource (XIII, 530 p)
ISBN:9783662217115
9783662217139
ISSN:0937-5511
DOI:10.1007/978-3-662-21711-5

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand! Volltext öffnen