Combinatorial Optimization: Polyhedra and Efficiency
Product Description
Combinatorial Optimization: Polyhedra and Efficiency
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.
Technical Specifications
Customers who bought this also bought
You might also like
The Probabilistic Method (Wiley Series in Discrete Mathematics and Optimization)
Theory of Linear and Integer Programming
Introduction to Linear Optimization (Athena Scientific Series in Optimization and Neural Computation, 6)
Approximation Algorithms
Integer Programming (Graduate Texts in Mathematics)
Probability and Random Processes
Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science)
Linear Algebra Done Right (Undergraduate Texts in Mathematics)