This is an on-line 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 P-NP, its rich history, and its algorithmic implications for everything we do with computers and beyond. In this informative and entertaining book.
It provides a nontechnical introduction to P-NP, its rich history, and its algorithmic implications for everything we do with computers and beyond. In this informative and entertaining book.
Title Solving NP-Complete Problems
Author(s) Forbes D. Lewis
Publisher: University of Kentucky (2013 - Date)
Language: English
eBook: http://www.cs.uky.edu/~lewis/cs-heuristic/text/contents.html
Author(s) Forbes D. Lewis
Publisher: University of Kentucky (2013 - Date)
Language: English
eBook: http://www.cs.uky.edu/~lewis/cs-heuristic/text/contents.html
No comments:
Post a Comment