Many-to-many assignment problems: Lagrangian bounds and heuristic

dc.contributorNuevo Leon State University
dc.contributorUniversidade Estadual Paulista (UNESP)
dc.date.accessioned2022-04-28T18:59:55Z
dc.date.accessioned2022-12-20T00:55:59Z
dc.date.available2022-04-28T18:59:55Z
dc.date.available2022-12-20T00:55:59Z
dc.date.created2022-04-28T18:59:55Z
dc.date.issued2011-12-01
dc.identifierInnovation in Power, Control, and Optimization: Emerging Energy Technologies, p. 220-247.
dc.identifierhttp://hdl.handle.net/11449/220161
dc.identifier10.4018/978-1-61350-138-2.ch007
dc.identifier2-s2.0-84901561312
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/5400290
dc.description.abstractModified 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.
dc.languageeng
dc.relationInnovation in Power, Control, and Optimization: Emerging Energy Technologies
dc.sourceScopus
dc.titleMany-to-many assignment problems: Lagrangian bounds and heuristic
dc.typeCapítulos de libros


Este ítem pertenece a la siguiente institución