A Linear Relaxation Heuristic for the Generalized Assignment Problem

We examine the basis structure of the linear relaxation of the generalized assignment problem. The basis gives a surprising amount of information. This leads to a very simple heuristic that uses only generalized network optimization codes. Lower bounds can be generated by cut generation, where the violated inequalities are found directly from the relaxation basis. An improvement heuristic with the same flavor is also presented.

[1]  Richard M. Soland,et al.  A branch and bound algorithm for the generalized assignment problem , 1975, Math. Program..

[2]  G. Ross,et al.  Modeling Facility Location Problems as Generalized Assignment Problems , 1977 .

[3]  Theodore D. Klastorin.  An effective subgradient algorithm for the generalized assignment problem , 1979, Comput. Oper. Res..

[4]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[5]  J. F. Benders,et al.  A property of assignment type mixed integer linear programming problems , 1982 .

[6]  A. Charnes,et al.  Invariant multiplicative efficiency and piecewise cobb-douglas envelopments , 1983 .

[7]  Linus Schrage,et al.  Linear, Integer, and Quadratic Programming with Lindo , 1984 .

[8]  Gerald G. Brown,et al.  Solving Generalized Networks , 1984 .

[9]  Marshall L. Fisher,et al.  An Applications Oriented Guide to Lagrangian Relaxation , 1985 .

[10]  R. McBride,et al.  Solving embedded generalized network problems , 1985 .

[11]  M. Fisher,et al.  A multiplier adjustment method for the generalized assignment problem , 1986 .

[12]  Charlotte Diane Jacobs.  The vehicle routing problem with backhauls , 1987 .

[13]  Jan Karel Lenstra,et al.  Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[14]  Michael A. Trick,et al.  GNO/PC generalized network optimization system , 1988 .

[15]  M. D. Wilkinson,et al.  Management science , 1989, British Dental Journal.

[16]  M. R. Rao,et al.  (1,k)-configuration facets for the generalized assignment problem , 1990, Math. Program..

[17]  M. R. Rao,et al.  The generalized assignment problem: Valid inequalities and facets , 1990, Math. Program..