Improved Lagrangian bounds and heuristics for the generalized assignment problem
Abstract
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.
How to cite this document
Litvinchev, I. et al. Improved Lagrangian bounds and heuristics for the generalized assignment problem. Journal of Computer and Systems Sciences International, v. 56, n. 5, p. 803-809, 2017. Available at: <http://hdl.handle.net/11449/170275>.
Language
English
Collections
