Computational results with a branch‐and‐bound algorithm for the general knapsack problem

This publication has 8 references indexed in Scilit:

• An Efficient Algorithm for the 0-1 Knapsack Problem
  Management Science, 1976
• When the Greedy Solution Solves a Class of Knapsack Problems
  Operations Research, 1975
• The knapsack problem: A survey
  Naval Research Logistics Quarterly, 1975
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey
  Management Science, 1972
• Technical Note—An Improved Branch-and-Bound Method for Integer Programming
  Operations Research, 1971
• A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
  Operations Research, 1965
• A tree-search algorithm for mixed integer programming problems
  The Computer Journal, 1965
• An Automatic Method of Solving Discrete Programming Problems
  Econometrica, 1960