Solving NP-Complete Problems
Overview & Synopsis
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.
Indexed from repository: FreeComputerBooks.com
(
freecomputerbooks.com)
Keyboard Shortcuts:
← / → for pages • + / - for zoom • 0 to fit width
Powered by Mozilla PDF.js v3.11
Document Information
| Document Title | Solving NP-Complete Problems |
|---|---|
| Author / Organization | Forbes D. Lewis |
| Subject & Discipline | Data Structures and Algorithms, Computational Complexity, Mathematical Logic - Set Theory, Model Theory, Computability, etc, Theory of Computation |
| Publication Year | 2013 |
| Resource Verification | Verification pending |
| Alternative Mirrors & Links | |
| Original Host Website |
FreeComputerBooks.com
(freecomputerbooks.com)
|
| File Format | application/pdf (Portable Document Format) |
| Language | ENGLISH |
| Catalog ID | DOC-259090 |
| Original Source Link | Visit Source Page on freecomputerbooks.com » |