Lagrangian heuristic for a class of the generalized assignment problems
| dc.contributor.author | Litvinchev, Igor | |
| dc.contributor.author | Mata, Miguel | |
| dc.contributor.author | Rangel, Socorro | |
| dc.contributor.author | Saucedo, Jania | |
| dc.contributor.institution | Russian Acad Sci | |
| dc.contributor.institution | UANL Nuevo Leon State Univ | |
| dc.contributor.institution | Universidade Estadual Paulista (Unesp) | |
| dc.date.accessioned | 2014-05-20T15:30:47Z | |
| dc.date.available | 2014-05-20T15:30:47Z | |
| dc.date.issued | 2010-08-01 | |
| dc.description.abstract | A 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.affiliation | Russian Acad Sci, Dorodnicyn Comp Ctr, Moscow, Russia | |
| dc.description.affiliation | UANL Nuevo Leon State Univ, Fac Mech & Elect Engn, Nuevo Leon, Mexico | |
| dc.description.affiliation | UNESP São Paulo State Univ, Dept Comp Sci & Stat, São Paulo, Brazil | |
| dc.description.affiliationUnesp | UNESP São Paulo State Univ, Dept Comp Sci & Stat, São Paulo, Brazil | |
| dc.format.extent | 1115-1123 | |
| dc.identifier | http://dx.doi.org/10.1016/j.camwa.2010.03.070 | |
| dc.identifier.citation | Computers & Mathematics With Applications. Oxford: Pergamon-Elsevier B.V. Ltd, v. 60, n. 4, p. 1115-1123, 2010. | |
| dc.identifier.dimensions | pub.1021546173 | |
| dc.identifier.doi | 10.1016/j.camwa.2010.03.070 | |
| dc.identifier.issn | 0898-1221 | |
| dc.identifier.issn | 1873-7668 | |
| dc.identifier.lattes | 3492330600130998 | |
| dc.identifier.orcid | 0000-0002-4130-9552 | |
| dc.identifier.orcid | 0000-0002-1850-4755 | |
| dc.identifier.orcid | 0000-0003-3910-8804 | |
| dc.identifier.orcid | 0000-0002-7864-8304 | |
| dc.identifier.uri | http://hdl.handle.net/11449/40099 | |
| dc.identifier.wos | WOS:000281175200018 | |
| dc.language.iso | eng | |
| dc.publisher | Pergamon-Elsevier B.V. Ltd | |
| dc.publisher | Elsevier | |
| dc.relation.ispartof | Computers & Mathematics With Applications | |
| dc.relation.ispartofjcr | 1.860 | |
| dc.relation.ispartofsjr | 1,058 | |
| dc.rights.accessRights | Acesso restrito | pt |
| dc.source | Web of Science | |
| dc.source | Dimensions | |
| dc.subject | Lagrangian heuristic | en |
| dc.subject | Integer programming | en |
| dc.subject | Many-to-many assignment problem | en |
| dc.title | Lagrangian heuristic for a class of the generalized assignment problems | en |
| dc.type | Artigo | pt |
| dcterms.license | http://www.elsevier.com/about/open-access/open-access-policies/article-posting-policy | |
| dcterms.rightsHolder | Pergamon-Elsevier B.V. Ltd | |
| dspace.entity.type | Publication | |
| relation.isAuthorOfPublication | c297c977-7d75-4b1a-995d-0a90989597f9 | |
| relation.isAuthorOfPublication.latestForDiscovery | c297c977-7d75-4b1a-995d-0a90989597f9 |

