Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science)
Product Description
Condition - Very Good
The item shows wear from consistent use but remains in good condition. It may arrive with damaged packaging or be repackaged.
Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science)
This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering. "Mathematicians wishing a self-contained introduction need look no further." — American Mathematical Monthly.
Technical Specifications
You might also like
How to Solve It: Modern Heuristics
Introduction to Graph Theory (Dover Books on Mathematics)
Combinatorial Optimization: Networks and Matroids (Dover Books on Mathematics)
An Introduction to Information Theory: Symbols, Signals and Noise (Dover Books on Mathematics)
The Elements of Statistical Learning: Data Mining, Inference, and Prediction, Second Edition (Springer Series in Statistics)
Numerical Optimization (Springer Series in Operations Research and Financial Engineering)
Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis
Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
Algorithms
Neural Networks and Deep Learning: A Textbook