Logotipo do repositório
 

Publicação:
Lagrangian heuristic for a class of the generalized assignment problems

Página do item simplificado
dc.contributor.authorLitvinchev, Igor
dc.contributor.authorMata, Miguel
dc.contributor.authorRangel, Socorro
dc.contributor.authorSaucedo, Jania
dc.contributor.institutionRussian Acad Sci
dc.contributor.institutionUANL Nuevo Leon State Univ
dc.contributor.institutionUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2014-05-20T15:30:47Z
dc.date.available2014-05-20T15:30:47Z
dc.date.issued2010-08-01
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.en
dc.description.affiliationRussian Acad Sci, Dorodnicyn Comp Ctr, Moscow, Russia
dc.description.affiliationUANL Nuevo Leon State Univ, Fac Mech & Elect Engn, Nuevo Leon, Mexico
dc.description.affiliationUNESP São Paulo State Univ, Dept Comp Sci & Stat, São Paulo, Brazil
dc.description.affiliationUnespUNESP São Paulo State Univ, Dept Comp Sci & Stat, São Paulo, Brazil
dc.format.extent1115-1123
dc.identifierhttp://dx.doi.org/10.1016/j.camwa.2010.03.070
dc.identifier.citationComputers & Mathematics With Applications. Oxford: Pergamon-Elsevier B.V. Ltd, v. 60, n. 4, p. 1115-1123, 2010.
dc.identifier.doi10.1016/j.camwa.2010.03.070
dc.identifier.issn0898-1221
dc.identifier.urihttp://hdl.handle.net/11449/40099
dc.identifier.wosWOS:000281175200018
dc.language.isoeng
dc.publisherPergamon-Elsevier B.V. Ltd
dc.relation.ispartofComputers & Mathematics With Applications
dc.relation.ispartofjcr1.860
dc.relation.ispartofsjr1,058
dc.rights.accessRightsAcesso restrito
dc.sourceWeb of Science
dc.subjectLagrangian heuristicen
dc.subjectInteger programmingen
dc.subjectMany-to-many assignment problemen
dc.titleLagrangian heuristic for a class of the generalized assignment problemsen
dc.typeArtigo
dcterms.licensehttp://www.elsevier.com/about/open-access/open-access-policies/article-posting-policy
dcterms.rightsHolderPergamon-Elsevier B.V. Ltd
dspace.entity.typePublication

Arquivos

Licença do Pacote

Agora exibindo 1 - 2 de 2
Imagem de Miniatura
Nome:
license.txt
Tamanho:
1.71 KB
Formato:
Item-specific license agreed upon to submission
Descrição:
Imagem de Miniatura
Nome:
license.txt
Tamanho:
1.71 KB
Formato:
Item-specific license agreed upon to submission
Descrição:

Coleções

Artigos