Improved Lagrangian bounds and heuristics for the generalized assignment problem
Restricciones de acceso
MetadatosMostrar el registro completo del ítem
Modified Lagrangian bounds are proposed for the generalized assignment problem. The approach is based on a double decomposable structure of the formulation. A family of greedy heuristics is considered to get Lagrangian based feasible solutions. Numerical results for problem instances with number of agents close to number of tasks are provided.