| Article ID: | iaor20032499 |
| Country: | Canada |
| Volume: | 39 |
| Issue: | 4 |
| Start Page Number: | 351 |
| End Page Number: | 356 |
| Publication Date: | Nov 2001 |
| Journal: | INFOR |
| Authors: | Haddadi S., Ouzia H. |
| Keywords: | lagrange multipliers, heuristics |
An algorithm is presented for generating and improving feasible assignments for the generalized assignment problem (GAP). This algorithm is applied at each iteration of a subgradient method for the weak Lagrangian relaxation of the GAP. Computational results are presented and compared with other heuristics.