An algorithm for 0‐1 multiple‐knapsack problems

This publication has 17 references indexed in Scilit:

• An algorithm for a class of loading problems
  Naval Research Logistics Quarterly, 1978
• A branch and bound algorithm for the generalized assignment problem
  Mathematical Programming, 1975
• Surrogate Constraint Duality in Mathematical Programming
  Operations Research, 1975
• The knapsack problem: A survey
  Naval Research Logistics Quarterly, 1975
• Lagrangean relaxation for integer programming
  Published by Springer Nature ,1974
• Improved Combinatorial Programming Algorithms for a Class of All-Zero-One Integer Programming Problems
  Management Science, 1973
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey
  Management Science, 1972
• The Loading Problem
  Management Science, 1971
• An Improved Implicit Enumeration Approach for Integer Programming
  Operations Research, 1969
• Surrogate Constraints
  Operations Research, 1968