2129:-
Uppskattad leveranstid 10-15 arbetsdagar
Fri frakt för medlemmar vid köp för minst 249:-
Andra format:
- Inbunden 3069:-
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.
- Format: Inbunden
- ISBN: 9783540443896
- Språk: Engelska
- Antal sidor: 1879
- Utgivningsdatum: 2002-12-01
- Förlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. K