<--- Back to Details
First PageDocument Content
Operations research / Combinatorial optimization / NP-complete problems / Dynamic programming / Equations / Knapsack problem / Change-making problem / Shortest path problem / Floyd–Warshall algorithm / Mathematics / Theoretical computer science / Computational complexity theory
Date: 2012-11-08 19:42:30
Operations research
Combinatorial optimization
NP-complete problems
Dynamic programming
Equations
Knapsack problem
Change-making problem
Shortest path problem
Floyd–Warshall algorithm
Mathematics
Theoretical computer science
Computational complexity theory

Document is deleted from original location.
Use the Download Button below to download from the Web Archive.

Download Document from Web Archive

File Size: 217,35 KB