

Title Solving NPComplete Problems
Author(s) Forbes D. Lewis
Publisher: University of Kentucky (2013  Date)
Language: English  Book Description
This is an online textbook on heuristic algorithms. From the table of contents: Classes of Problems; Integer Programming; Enumeration Techniques; Dynamic Programming; Approximate Solutions; Local Optimization; Natural Models.
It provides a nontechnical introduction to PNP, its rich history, and its algorithmic implications for everything we do with computers and beyond. In this informative and entertaining book. More Data Structures and Algorithms eBooks: Linear Programming: Foundations and Extensions Algorithms and Data Structures With Applications to Graphics and Geometry Matters Computational: Ideas, Algorithms, Source Code Exploring Randomness Ant Colony Optimization  Techniques and Applications Fundamental Data Structures Introduction to Design Analysis of Algorithms Think Complexity: Complexity Science and Computational Modeling Traveling Salesman Problem, Theory and Applications Knapsack Problems: Algorithms and Computer Implementations Information Theory, Inference and Learning Algorithms RealWorld Applications of Genetic Algorithms New Frontiers in Graph Theory Search Algorithms for Engineering Optimization Data Structures Succinctly, Part 2

