Übersicht			Auf mobile öffnen

Lieferstatus:	i.d.R. innert 14-24 Tagen versandfertig
Veröffentlichung:	Dezember 2002
Genre:	Schulbücher
	Algorithms / B / Combinatorics / Combinatorics & graph theory / Computer science—Mathematics / Discrete Mathematics / Discrete Mathematics in Computer Science / Management & management techniques / Management science / Mathematics and Statistics / Maths for computer scientists / Numerical analysis / Operations Research / Operations Research, Management Science
ISBN:	9783540443896
EAN-Code:	9783540443896
Verlag:	Springer Berlin Heidelberg
Einband:	Gebunden
Sprache:	English
Dimensionen:	H 241 mm / B 160 mm / D 123 mm
Gewicht:	3451 gr
Seiten:	1992
Zus. Info:	HC runder Rücken kaschiert
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

This book offers an in-depth overview of polyhedral methods and efficient algorithms in combinatorial optimization.These methods form a broad, coherent and powerful kernel in combinatorial optimization, with strong links to discrete mathematics, mathematical programming and computer science. In eight parts, various areas are treated, each starting with an elementary introduction to the area, with short, elegant proofs of the principal results, and each evolving to the more advanced methods and results, with full proofs of some of the deepest theorems in the area. Over 4000 references to further research are given, and historical surveys on the basic subjects are presented.