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

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.contributorNuevo Leon State University-
Autor(es): dc.contributorUniversidade Estadual Paulista (UNESP)-
Autor(es): dc.creatorLitvinchev, Igor-
Autor(es): dc.creatorRangel, Socorro [UNESP]-
Data de aceite: dc.date.accessioned2022-08-04T22:04:02Z-
Data de disponibilização: dc.date.available2022-08-04T22:04:02Z-
Data de envio: dc.date.issued2022-04-28-
Data de envio: dc.date.issued2022-04-28-
Data de envio: dc.date.issued2011-12-01-
Fonte completa do material: dc.identifierhttp://dx.doi.org/10.4018/978-1-61350-138-2.ch007-
Fonte completa do material: dc.identifierhttp://hdl.handle.net/11449/220161-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/11449/220161-
Descrição: dc.descriptionModified 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.-
Descrição: dc.descriptionNuevo Leon State University-
Descrição: dc.descriptionState University of São Paulo (UNESP), São José do Rio Preto-
Descrição: dc.descriptionState University of São Paulo (UNESP), São José do Rio Preto-
Formato: dc.format220-247-
Idioma: dc.languageen-
Relação: dc.relationInnovation in Power, Control, and Optimization: Emerging Energy Technologies-
???dc.source???: dc.sourceScopus-
Título: dc.titleMany-to-many assignment problems: Lagrangian bounds and heuristic-
Aparece nas coleções:Repositório Institucional - Unesp

Não existem arquivos associados a este item.