电邮这篇文章 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
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
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
