Combinatorial Optimization Polyhedra and Efficiency by Alexander Schrijver
Buy 2, get 1 free. Applied automatically at checkout.
Before you buy
-
Check your email at checkoutYour download link is sent to the address you enter, so make sure it's typed correctly.
-
This is a digital PDFNothing is shipped. The download link arrives by email right after payment.
-
30-day money-back guaranteeIf the file doesn't work, we'll replace it or refund you.
Send us a photo of the cover in live chat and we'll look for it. We usually reply within 10 minutes.
About this book
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.
Book details
- Format
- PDF, instant download
- Language
- English
Why buy here
The PDF is delivered as soon as your payment clears, day or night.
The full edition, every chapter, no missing pages.
Questions about your order? Message us in live chat any time.
Encrypted checkout with all major cards and wallets.