You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/40099
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLitvinchev, Igor-
dc.contributor.authorMata, Miguel-
dc.contributor.authorRangel, Socorro-
dc.contributor.authorSaucedo, Jania-
dc.date.accessioned2014-05-20T15:30:47Z-
dc.date.accessioned2016-10-25T18:06:25Z-
dc.date.available2014-05-20T15:30:47Z-
dc.date.available2016-10-25T18:06:25Z-
dc.date.issued2010-08-01-
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.issn0898-1221-
dc.identifier.urihttp://hdl.handle.net/11449/40099-
dc.identifier.urihttp://acervodigital.unesp.br/handle/11449/40099-
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.format.extent1115-1123-
dc.language.isoeng-
dc.publisherPergamon-Elsevier B.V. Ltd-
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.typeoutro-
dc.contributor.institutionRussian Acad Sci-
dc.contributor.institutionUANL Nuevo Leon State Univ-
dc.contributor.institutionUniversidade Estadual Paulista (UNESP)-
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.identifier.doi10.1016/j.camwa.2010.03.070-
dc.identifier.wosWOS:000281175200018-
dc.rights.accessRightsAcesso restrito-
dc.relation.ispartofComputers & Mathematics With Applications-
Appears in Collections:Artigos, TCCs, Teses e Dissertações da Unesp

There are no files associated with this item.
Show simple item record Show full item record   View Statistics
 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.