Publicação: Many-to-many assignment problems: Lagrangian bounds and heuristic
| dc.contributor.author | Litvinchev, Igor | |
| dc.contributor.author | Rangel, Socorro [UNESP] | |
| dc.contributor.institution | Nuevo Leon State University | |
| dc.contributor.institution | Universidade Estadual Paulista (UNESP) | |
| dc.date.accessioned | 2022-04-28T18:59:55Z | |
| dc.date.available | 2022-04-28T18:59:55Z | |
| dc.date.issued | 2011-12-01 | |
| dc.description.abstract | Modified Lagrangian bounds and a greedy heuristic are proposed for many-to-many assignment problems taking into account capacity limits for tasks and agents. A feasible solution recovered by the heuristic is used to speed up the subgradient technique to solve the modified Lagrangian dual. A numerical study is presented to compare the quality of the bounds and to demonstrate the efficiency of the overall approach. © 2012, IGI Global. | en |
| dc.description.affiliation | Nuevo Leon State University | |
| dc.description.affiliation | State University of São Paulo (UNESP), São José do Rio Preto | |
| dc.description.affiliationUnesp | State University of São Paulo (UNESP), São José do Rio Preto | |
| dc.format.extent | 220-247 | |
| dc.identifier | http://dx.doi.org/10.4018/978-1-61350-138-2.ch007 | |
| dc.identifier.citation | Innovation in Power, Control, and Optimization: Emerging Energy Technologies, p. 220-247. | |
| dc.identifier.doi | 10.4018/978-1-61350-138-2.ch007 | |
| dc.identifier.scopus | 2-s2.0-84901561312 | |
| dc.identifier.uri | http://hdl.handle.net/11449/220161 | |
| dc.language.iso | eng | |
| dc.relation.ispartof | Innovation in Power, Control, and Optimization: Emerging Energy Technologies | |
| dc.source | Scopus | |
| dc.title | Many-to-many assignment problems: Lagrangian bounds and heuristic | en |
| dc.type | Capítulo de livro | pt |
| dspace.entity.type | Publication | |
| unesp.campus | Universidade Estadual Paulista (UNESP), Instituto de Biociências, Letras e Ciências Exatas, São José do Rio Preto | pt |