| dc.contributor | Universidade Estadual Paulista (UNESP) | |
| dc.creator | Litvinchev, Igor | |
| dc.creator | Mata, Miguel | |
| dc.creator | Rangel, Socorro | |
| dc.creator | Saucedo, Jania | |
| dc.date | 2014-05-20T15:30:47Z | |
| dc.date | 2016-10-25T18:06:25Z | |
| dc.date | 2014-05-20T15:30:47Z | |
| dc.date | 2016-10-25T18:06:25Z | |
| dc.date | 2010-08-01 | |
| dc.date.accessioned | 2017-04-06T00:18:53Z | |
| dc.date.available | 2017-04-06T00:18:53Z | |
| dc.identifier | Computers & Mathematics With Applications. Oxford: Pergamon-Elsevier B.V. Ltd, v. 60, n. 4, p. 1115-1123, 2010. | |
| dc.identifier | 0898-1221 | |
| dc.identifier | http://hdl.handle.net/11449/40099 | |
| dc.identifier | http://acervodigital.unesp.br/handle/11449/40099 | |
| dc.identifier | 10.1016/j.camwa.2010.03.070 | |
| dc.identifier | WOS:000281175200018 | |
| dc.identifier | http://dx.doi.org/10.1016/j.camwa.2010.03.070 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/882906 | |
| dc.description | 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. | |
| dc.language | eng | |
| dc.publisher | Pergamon-Elsevier B.V. Ltd | |
| dc.relation | Computers & Mathematics With Applications | |
| dc.rights | info:eu-repo/semantics/closedAccess | |
| dc.subject | Lagrangian heuristic | |
| dc.subject | Integer programming | |
| dc.subject | Many-to-many assignment problem | |
| dc.title | Lagrangian heuristic for a class of the generalized assignment problems | |
| dc.type | Otro | |
