Exact methods for the knapsack problem and its generalizations

This publication has 28 references indexed in Scilit:

• A fast algorithm for the linear multiple-choice knapsack problem
  Operations Research Letters, 1984
• An O(n) algorithm for the linear multiple choice knapsack problem and related problems
  Information Processing Letters, 1984
• AnO (n)-algorithm for LP-knapsacks with a fixed number of GUB constraints
  Mathematical Methods of Operations Research, 1984
• A computational study of a multiple-choice knapsack algorithm
  ACM Transactions on Mathematical Software, 1983
• The complexity of selection and ranking in X + Y and matrices with sorted columns
  Journal of Computer and System Sciences, 1982
• A note of the knapsack problem with special ordered sets
  Operations Research Letters, 1981
• Covering, Packing and Knapsack Problems
  Annals of Discrete Mathematics, 1979
• An improved upper bound for the zero-one knapsack problem: A note on the paper by Martello and Toth
  European Journal of Operational Research, 1978
• The 0–1 knapsack problem with multiple choice constraints
  European Journal of Operational Research, 1978
• An upper bound for the zero-one knapsack problem and a branch and bound algorithm
  European Journal of Operational Research, 1977