Improved Lagrangean Decomposition: An Application to the Generalized Assignment Problem

Detalhes bibliográficos
Autor(a) principal: Bárcia, Paulo
Data de Publicação: 1989
Outros Autores: Jornsten, Kurt
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/10362/84564
Resumo: Recently two new ways of obtaining improved Lagrangean bounds have been suggested: Lagrangean decomposition and bound improving sequences. In this work we will obtain a Lagrangean approach combining the two ideas mentioned above. We provide theoretical results about the sharpness of the bounds obtained by the combined approach for the general case and an application to the generalized assignment problem. Computational experience is reported.
id RCAP_38a6fde933754cfd0e3b8f6073974462
oai_identifier_str oai:run.unl.pt:10362/84564
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling Improved Lagrangean Decomposition: An Application to the Generalized Assignment ProblemInteger programmingLagrange multipliersAssignementRecently two new ways of obtaining improved Lagrangean bounds have been suggested: Lagrangean decomposition and bound improving sequences. In this work we will obtain a Lagrangean approach combining the two ideas mentioned above. We provide theoretical results about the sharpness of the bounds obtained by the combined approach for the general case and an application to the generalized assignment problem. Computational experience is reported.Nova SBERUNBárcia, PauloJornsten, Kurt2019-10-17T14:56:53Z1989-041989-04-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10362/84564engBárcia, Paulo and Jornsten, Kurt, Improved Lagrangean Decomposition: An Application to the Generalized Assignment Problem (April, 1989). FEUNL Working Paper Series No. 116info:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2024-03-11T04:37:44Zoai:run.unl.pt:10362/84564Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T03:36:30.876348Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv Improved Lagrangean Decomposition: An Application to the Generalized Assignment Problem
title Improved Lagrangean Decomposition: An Application to the Generalized Assignment Problem
spellingShingle Improved Lagrangean Decomposition: An Application to the Generalized Assignment Problem
Bárcia, Paulo
Integer programming
Lagrange multipliers
Assignement
title_short Improved Lagrangean Decomposition: An Application to the Generalized Assignment Problem
title_full Improved Lagrangean Decomposition: An Application to the Generalized Assignment Problem
title_fullStr Improved Lagrangean Decomposition: An Application to the Generalized Assignment Problem
title_full_unstemmed Improved Lagrangean Decomposition: An Application to the Generalized Assignment Problem
title_sort Improved Lagrangean Decomposition: An Application to the Generalized Assignment Problem
author Bárcia, Paulo
author_facet Bárcia, Paulo
Jornsten, Kurt
author_role author
author2 Jornsten, Kurt
author2_role author
dc.contributor.none.fl_str_mv RUN
dc.contributor.author.fl_str_mv Bárcia, Paulo
Jornsten, Kurt
dc.subject.por.fl_str_mv Integer programming
Lagrange multipliers
Assignement
topic Integer programming
Lagrange multipliers
Assignement
description Recently two new ways of obtaining improved Lagrangean bounds have been suggested: Lagrangean decomposition and bound improving sequences. In this work we will obtain a Lagrangean approach combining the two ideas mentioned above. We provide theoretical results about the sharpness of the bounds obtained by the combined approach for the general case and an application to the generalized assignment problem. Computational experience is reported.
publishDate 1989
dc.date.none.fl_str_mv 1989-04
1989-04-01T00:00:00Z
2019-10-17T14:56:53Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10362/84564
url http://hdl.handle.net/10362/84564
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Bárcia, Paulo and Jornsten, Kurt, Improved Lagrangean Decomposition: An Application to the Generalized Assignment Problem (April, 1989). FEUNL Working Paper Series No. 116
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Nova SBE
publisher.none.fl_str_mv Nova SBE
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799137983405752320

Registros relacionados