|LC control no.||sh 99013404
|Topical heading||Knapsack problem (Mathematics)
|See also||Integer programming
|Found in||Ingargiola, G. A general algorithm for one-dimensional knapsack problems, 1974.
McGraw Hill dict. sci. tech. (Knapsack problem: The problem, given a set of integers (A1, A2, ... An) and a target integer B, of determining whether a subset of the Ai can be selected without repetition so that their sum is the target B)
Dict. of computing, 1997 (Knapsack problem: A common example of an integer programming problem)
LC database, July 30, 1999 (Knapsack-Problem; Knapsack problems; knapsack problem)