ID: 163900
Beschreibung
ISBN: 9783540443896
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.
Dit artikel bestel je voordelig 2e hands op studystore.nlIn goede staat, snel in huis én gratis thuisbezorgd. Toelichting:De prijs in deze advertentie is gebaseerd op onze laagste 2e hands prijs (OP=OP).Zodra een 2e hands boek op is, kan het voorkomen dat je op Studystore het boek alleen nog nieuw kunt bestellen.
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.
Dit artikel bestel je voordelig 2e hands op studystore.nlIn goede staat, snel in huis én gratis thuisbezorgd. Toelichting:De prijs in deze advertentie is gebaseerd op onze laagste 2e hands prijs (OP=OP).Zodra een 2e hands boek op is, kan het voorkomen dat je op Studystore het boek alleen nog nieuw kunt bestellen.