| Combinatorial Optimization: Polyhedra and Efficiency 2003 Edition Contributor(s): Schrijver, Alexander (Author) |
|
 |
ISBN: 3540443894 ISBN-13: 9783540443896 Publisher: Springer OUR PRICE: $151.99 Product Type: Hardcover Published: December 2002 Annotation: 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. |
| Additional Information |
| BISAC Categories: - Mathematics | Game Theory - Medical - Mathematics | Linear & Nonlinear Programming |
| Dewey: 519.3 |
| LCCN: 2002036693 |
| Series: Algorithms and Combinatorics |
| Physical Information: 3.9" H x 6.5" W x 10.5" (7.00 lbs) 1879 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: 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. |