First Page | Document Content | |
---|---|---|
![]() Date: 2012-11-08 19:42:30Operations 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. Download Document from Web Archive |