Combinatorial Optimization [electronic resource] : Theory and Algorithms /

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.

Bibliographic Details

Main Authors:	Korte, Bernhard. author., Vygen, Jens. author., SpringerLink (Online service)
Format:	Texto biblioteca
Language:	eng
Published:	Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002
Subjects:	Mathematics., Computer science, Calculus of variations., Combinatorics., Calculus of Variations and Optimal Control; Optimization., Mathematics of Computing.,
Online Access:	http://dx.doi.org/10.1007/978-3-662-21711-5
Tags:	Add Tag No Tags, Be the first to tag this record!