Lagrangian heuristic for a class of the generalized assignment problems

dc.contributorRussian Acad Sci
dc.contributorUANL Nuevo Leon State Univ
dc.contributorUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2014-05-20T15:30:47Z
dc.date.available2014-05-20T15:30:47Z
dc.date.created2014-05-20T15:30:47Z
dc.date.issued2010-08-01
dc.identifierComputers & Mathematics With Applications. Oxford: Pergamon-Elsevier B.V. Ltd, v. 60, n. 4, p. 1115-1123, 2010.
dc.identifier0898-1221
dc.identifierhttp://hdl.handle.net/11449/40099
dc.identifier10.1016/j.camwa.2010.03.070
dc.identifierWOS:000281175200018
dc.description.abstractA Lagrangian based heuristic is proposed for many-to-many assignment problems taking into account capacity limits for task and agents. A modified Lagrangian bound studied earlier by the authors is presented and a greedy heuristic is then applied to get a feasible Lagrangian-based solution. The latter is also used to speed up the subgradient scheme to solve the modified Lagrangian dual problem. A numerical study is presented to demonstrate the efficiency of the proposed approach. (C) 2010 Elsevier Ltd. All rights reserved.
dc.languageeng
dc.publisherPergamon-Elsevier B.V. Ltd
dc.relationComputers & Mathematics With Applications
dc.relation1.860
dc.relation1,058
dc.rightsAcesso restrito
dc.sourceWeb of Science
dc.subjectLagrangian heuristic
dc.subjectInteger programming
dc.subjectMany-to-many assignment problem
dc.titleLagrangian heuristic for a class of the generalized assignment problems
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución