Отправить статью по E-mail Improved Lagrangian bounds and heuristics for the generalized assignment problem
- Авторы: Litvinchev I.1,2,3, Mata M.1,2,3, Saucedo J.1,2,3, Rangel S.1,2,3
-
Учреждения:
- Computing Center Russian Academy of Sciences
- Faculty of Mechanical and Electrical Engineering(UANL)
- Department of Applied Mathematics (UNESP)
- Выпуск: Том 56, № 5 (2017)
- Страницы: 803-809
- Раздел: Systems Analysis and Operations Research
- URL: https://journals.rcsi.science/1064-2307/article/view/219974
- DOI: https://doi.org/10.1134/S1064230717050070
- ID: 219974
Цитировать
Открытый доступ
Доступ предоставлен
Только для подписчиков
Аннотация
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.
Об авторах
I. Litvinchev
Computing Center Russian Academy of Sciences; Faculty of Mechanical and Electrical Engineering(UANL); Department of Applied Mathematics (UNESP)
Автор, ответственный за переписку.
Email: igorlitvinchev@gmail.com
Россия, 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
Россия, 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
Россия, 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
Россия, Moscow; New Leon; Saint Paulo
