Enviar artigo por via de e-mail Improved Lagrangian bounds and heuristics for the generalized assignment problem
- Autores: Litvinchev I.1,2,3, Mata M.1,2,3, Saucedo J.1,2,3, Rangel S.1,2,3
-
Afiliações:
- Computing Center Russian Academy of Sciences
- Faculty of Mechanical and Electrical Engineering(UANL)
- Department of Applied Mathematics (UNESP)
- Edição: Volume 56, Nº 5 (2017)
- Páginas: 803-809
- Seção: Systems Analysis and Operations Research
- URL: https://journals.rcsi.science/1064-2307/article/view/219974
- DOI: https://doi.org/10.1134/S1064230717050070
- ID: 219974
Citar
Acesso aberto
Acesso está concedido
Somente assinantes
Resumo
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.
Sobre autores
I. Litvinchev
Computing Center Russian Academy of Sciences; Faculty of Mechanical and Electrical Engineering(UANL); Department of Applied Mathematics (UNESP)
Autor responsável pela correspondência
Email: igorlitvinchev@gmail.com
Rússia, Moscow; New Leon; Saint Paulo
M. Mata
Computing Center Russian Academy of Sciences; Faculty of Mechanical and Electrical Engineering(UANL); Department of Applied Mathematics (UNESP)
Email: igorlitvinchev@gmail.com
Rússia, Moscow; New Leon; Saint Paulo
J. Saucedo
Computing Center Russian Academy of Sciences; Faculty of Mechanical and Electrical Engineering(UANL); Department of Applied Mathematics (UNESP)
Email: igorlitvinchev@gmail.com
Rússia, Moscow; New Leon; Saint Paulo
S. Rangel
Computing Center Russian Academy of Sciences; Faculty of Mechanical and Electrical Engineering(UANL); Department of Applied Mathematics (UNESP)
Email: igorlitvinchev@gmail.com
Rússia, Moscow; New Leon; Saint Paulo
