Relaxation heuristics for a generalized assignment problem

This publication has 17 references indexed in Scilit:

• Exact methods for the knapsack problem and its generalizations
  Published by Elsevier ,2011
• A survey of algorithms for the generalized assignment problem
  European Journal of Operational Research, 1992
• OR-Library: Distributing Test Problems by Electronic Mail
  Journal of the Operational Research Society, 1990
• A fast algorithm for the linear multiple-choice knapsack problem
  Operations Research Letters, 1984
• An O(n) algorithm for the multiple-choice knapsack linear program
  Mathematical Programming, 1984
• A generalized assignment heuristic for vehicle routing
  Networks, 1981
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
  Management Science, 1981
• Calculating surrogate constraints
  Mathematical Programming, 1980
• An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks
  Operations Research, 1976
• An all Zero-One Algorithm for a Certain Class of Transportation Problems
  Operations Research, 1971