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

Detalhes bibliográficos
Autor(a) principal: Litvinchev, Igor
Data de Publicação: 2011
Outros Autores: Rangel, Socorro [UNESP]
Tipo de documento: Capítulo de livro
Idioma: eng
Título da fonte: Repositório Institucional da UNESP
Texto Completo: http://dx.doi.org/10.4018/978-1-61350-138-2.ch007
http://hdl.handle.net/11449/220161
Resumo: 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.
id UNSP_b00bf26b782ad80b34d7531c6b3e19e5
oai_identifier_str oai:repositorio.unesp.br:11449/220161
network_acronym_str UNSP
network_name_str Repositório Institucional da UNESP
repository_id_str 2946
spelling Many-to-many assignment problems: Lagrangian bounds and heuristicModified 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.Nuevo Leon State UniversityState University of São Paulo (UNESP), São José do Rio PretoState University of São Paulo (UNESP), São José do Rio PretoNuevo Leon State UniversityUniversidade Estadual Paulista (UNESP)Litvinchev, IgorRangel, Socorro [UNESP]2022-04-28T18:59:55Z2022-04-28T18:59:55Z2011-12-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/bookPart220-247http://dx.doi.org/10.4018/978-1-61350-138-2.ch007Innovation in Power, Control, and Optimization: Emerging Energy Technologies, p. 220-247.http://hdl.handle.net/11449/22016110.4018/978-1-61350-138-2.ch0072-s2.0-84901561312Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengInnovation in Power, Control, and Optimization: Emerging Energy Technologiesinfo:eu-repo/semantics/openAccess2022-04-28T18:59:55Zoai:repositorio.unesp.br:11449/220161Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462024-08-05T14:17:46.488283Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false
dc.title.none.fl_str_mv Many-to-many assignment problems: Lagrangian bounds and heuristic
title Many-to-many assignment problems: Lagrangian bounds and heuristic
spellingShingle Many-to-many assignment problems: Lagrangian bounds and heuristic
Litvinchev, Igor
title_short Many-to-many assignment problems: Lagrangian bounds and heuristic
title_full Many-to-many assignment problems: Lagrangian bounds and heuristic
title_fullStr Many-to-many assignment problems: Lagrangian bounds and heuristic
title_full_unstemmed Many-to-many assignment problems: Lagrangian bounds and heuristic
title_sort Many-to-many assignment problems: Lagrangian bounds and heuristic
author Litvinchev, Igor
author_facet Litvinchev, Igor
Rangel, Socorro [UNESP]
author_role author
author2 Rangel, Socorro [UNESP]
author2_role author
dc.contributor.none.fl_str_mv Nuevo Leon State University
Universidade Estadual Paulista (UNESP)
dc.contributor.author.fl_str_mv Litvinchev, Igor
Rangel, Socorro [UNESP]
description 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.
publishDate 2011
dc.date.none.fl_str_mv 2011-12-01
2022-04-28T18:59:55Z
2022-04-28T18:59:55Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/bookPart
format bookPart
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://dx.doi.org/10.4018/978-1-61350-138-2.ch007
Innovation in Power, Control, and Optimization: Emerging Energy Technologies, p. 220-247.
http://hdl.handle.net/11449/220161
10.4018/978-1-61350-138-2.ch007
2-s2.0-84901561312
url http://dx.doi.org/10.4018/978-1-61350-138-2.ch007
http://hdl.handle.net/11449/220161
identifier_str_mv Innovation in Power, Control, and Optimization: Emerging Energy Technologies, p. 220-247.
10.4018/978-1-61350-138-2.ch007
2-s2.0-84901561312
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Innovation in Power, Control, and Optimization: Emerging Energy Technologies
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv 220-247
dc.source.none.fl_str_mv Scopus
reponame:Repositório Institucional da UNESP
instname:Universidade Estadual Paulista (UNESP)
instacron:UNESP
instname_str Universidade Estadual Paulista (UNESP)
instacron_str UNESP
institution UNESP
reponame_str Repositório Institucional da UNESP
collection Repositório Institucional da UNESP
repository.name.fl_str_mv Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)
repository.mail.fl_str_mv
_version_ 1808128342913712128

Registros relacionados