AI News, The 0/1 Multidimensional Knapsack Problem and Its Variants: A ... artificial intelligence
- On Saturday, January 5, 2019
- By Read More
Methods for the Solution of the Multidimensional 0/1 Knapsack Problem
In the knapsack problem, given the desirability of each of a number of items, one seeks to find that subset which satisfies a constraint on total weight.
Additionally, the methods make integral use of an interactive computer system in which the heuristics of the problem solver are applied and changed as the character of the solution process evolves.