A survey of algorithms for the generalized assignment problem

[1]  A. M. Geoffrion.  Lagrangean Relaxation and Its Uses in Integer Programming , 1972 .

[2]  Egon Balas,et al.  Facets of the knapsack polytope , 1975, Math. Program..

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

[4]  V. Balachandran,et al.  An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks , 1976, Oper. Res..

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

[6]  Donald Erlenkotter,et al.  A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..

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

[8]  E. Balas,et al.  Pivot and Complement–A Heuristic for 0-1 Programming , 1980 .

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

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

[11]  Egon Balas,et al.  Nonlinear 0–1 programming: II. Dominance relations and algorithms , 1983, Math. Program..

[12]  Egon Balas,et al.  Nonlinear 0–1 programming: I. Linearization techniques , 1984, Math. Program..

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

[14]  Hasan Pirkul,et al.  Zero-one integer programs with few constraints —Efficient branch and bound algorithms , 1985 .

[15]  Hasan Pirkul,et al.  Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality , 1985, Math. Program..

[16]  Hasan Pirkul,et al.  Zero-one integer programs with few constraints --Lower bounding theory , 1985 .

[17]  Paulo Barcia.  The bound improving sequence algorithm , 1985 .

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

[19]  K. Jörnsten,et al.  A new Lagrangian relaxation approach to the generalized assignment problem , 1986 .

[20]  K. Dudzinski,et al.  Exact methods for the knapsack problem and its generalizations , 1987 .

[21]  P. Bárcia,et al.  A revised bound improvement sequence algorithm , 1988 .

[22]  A. W. Neebe,et al.  Bottleneck generalized assignment problems , 1988 .

[23]  Joseph B. Mazzola,et al.  Production planning of a flexible manufacturing system in a material requirements planning environment , 1989 .

[24]  Monique Guignard-Spielberg,et al.  Technical Note - An Improved Dual Based Algorithm for the Generalized Assignment Problem , 1989, Oper. Res..

[25]  J. Mazzola.  Generalized Assignment with Nonlinear Capacity Interaction , 1989 .

[26]  C. Ribeiro,et al.  An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment , 1989 .

[27]  M. Rosenwein,et al.  An application-oriented guide for designing Lagrangean dual ascent algorithms , 1989 .

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

[29]  Kurt Jörnsten,et al.  Improved Lagrangean decomposition: An application to the generalized assignment problem , 1990 .