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.
"synopsis" may belong to another edition of this title.
Alexander Schrijver is one of the most respected researchers in this area. He has won the Dantzig award, the Fulkerson prize (twice) and the Lanchester Prize for his earlier classic text on "Theory of Linear and Integer Programming".
Aus den Rezensionen:
"... ‘Effiziente Algorithmen‘ und ‘Kombinatorik der Polyeder‘ bilden ... den roten Faden durch das monumentale Werk ... Sehr knappe Einführungen in das jeweilige Thema, ein paar einfache erste Resultate ... und dann eine enzykoplädische [sic] Durchsicht der Methoden, Ideen, Varianten, Laufzeiten, mit einer überaus detaillierten Literaturliste und historischen Zusammenfassung. Alles wird nüchtern ... dargeboten ... Man blättert das Buch durch ... und erkennt mit Respekt und Staunen, dass der Autor alles, aber auch wirklich alles durchgearbeitet hat - eine große Leistung. ... Ich kenne kein vergleichbares neueres Werk ..." (M. Aigner, 2006, Issue 3, S. 15-16)
"About this title" may belong to another edition of this title.
US$ 33.18 shipping from United Kingdom to U.S.A.
Destination, rates & speedsSeller: Mispah books, Redhill, SURRE, United Kingdom
cd_rom. Condition: Like New. Like New. book. Seller Inventory # ERICA80035402045636
Quantity: 1 available