Description: retrospective (b a c k t r a c k i n g) is a systematic search to answer the question. To achieve retrospective, the first issue of the need for a definition of the solution space (solution space), The space must contain at least one solution to the problem (which may be optimal). Rats in a maze problem, we can contain a definition from the entrance to the export of the solution space trails; n is the object of the 0/1 knapsack problem (see 1. 4 and 2. 2) The solution space is a reasonable choice of two n length of the 0 n/a vector set, this assembly that it will 0 or 1 x allocated to all possible ways. When n = 3, the solution space for the ((0, 0, 0), (0, 1, 0), (0, 0, 1), (1, 0, 0), (0, 1, 1), (1, 0, 1), (1, 1, 0), (1, 1, 1)).
To Search:
- [dtgh] - and the greedy algorithm, the dynamic pr
- [LockWin] - first to write things go wrong, please e
- [01beibaozhenghechengxu] - Knapsack problem is very useful package
- [code] - Retrospective Method 01 knapsack problem
File list (Check if you may need any files):
Download