A heuristic solution procedure for the multiconstraint zero-one knapsack problem

This publication has 27 references indexed in Scilit:

• Some relationships between lagrangian and surrogate duality in integer programming
  Mathematical Programming, 1979
• A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
  Journal of the Operational Research Society, 1979
• Zero-one programming with many variables and few 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
• A Sequential Approach to the $0 - 1$ Linear Programming Problem
  SIAM Journal on Applied Mathematics, 1976
• The knapsack problem: A survey
  Naval Research Logistics Quarterly, 1975
• A Capital Budgeting Heuristic Algorithm Using Exchange Operations
  A I I E Transactions, 1974
• A heuristic algorithm for mixed-integer programming problems
  Published by Springer Nature ,1974
• An implicit enumeration program for zero-one integer programming
  International Journal of Parallel Programming, 1972
• Quasi-Convex Programming
  SIAM Journal on Applied Mathematics, 1968