Publicação:
A Lagrangian bound for many-to-many assignment problems

Página do item simplificado
dc.contributor.authorLitvinchev, Igor
dc.contributor.authorRangel, Socorro
dc.contributor.authorSaucedo, Jania
dc.contributor.institutionUANL
dc.contributor.institutionUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2014-05-20T15:30:18Z
dc.date.available2014-05-20T15:30:18Z
dc.date.issued2010-04-01
dc.description.abstractA simple procedure to tighten the Lagrangian bounds is proposed. The approach is interpreted in two ways. First, it can be seen as a reformulation of the original problem aimed to split the resulting Lagrangian problem into two subproblems. Second, it can be considered as a search for a tighter estimation of the penalty term arising in the Lagrangian problem. The new bounds are illustrated by a small example and studied numerically for a class of the generalized assignment problems.en
dc.description.affiliationUANL, Dept Mech & Elect Engn, Monterrey, Mexico
dc.description.affiliationSão Paulo State Univ UNESP, BR-15054000 Sj do Rio Preto, Brazil
dc.description.affiliationUnespSão Paulo State Univ UNESP, BR-15054000 Sj do Rio Preto, Brazil
dc.description.sponsorshipConsejo Nacional de Ciencia y Tecnología (CONACYT)
dc.description.sponsorshipConselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
dc.description.sponsorshipFundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
dc.description.sponsorshipIdMexican foundation CONACyT: 61343
dc.description.sponsorshipIdMexican foundation CONACyT: 61903
dc.description.sponsorshipIdCNPq: 473001/2004-7
dc.description.sponsorshipIdFAPESP: 07/08678-5
dc.description.sponsorshipIdFAPESP: 06/03496-3
dc.format.extent241-257
dc.identifierhttp://dx.doi.org/10.1007/s10878-008-9196-3
dc.identifier.citationJournal of Combinatorial Optimization. Dordrecht: Springer, v. 19, n. 3, p. 241-257, 2010.
dc.identifier.doi10.1007/s10878-008-9196-3
dc.identifier.issn1382-6905
dc.identifier.urihttp://hdl.handle.net/11449/39723
dc.identifier.wosWOS:000275781900001
dc.language.isoeng
dc.publisherSpringer
dc.relation.ispartofJournal of Combinatorial Optimization
dc.relation.ispartofjcr0.927
dc.relation.ispartofsjr0,579
dc.rights.accessRightsAcesso restrito
dc.sourceWeb of Science
dc.subjectLagrangian boundsen
dc.subjectInteger programmingen
dc.subjectMany-to-many-assignment problemen
dc.titleA Lagrangian bound for many-to-many assignment problemsen
dc.typeArtigo
dcterms.licensehttp://www.springer.com/open+access/authors+rights?SGWID=0-176704-12-683201-0
dcterms.rightsHolderSpringer
dspace.entity.typePublication
unesp.author.orcid0000-0003-3910-8804[2]

Arquivos

Licença do Pacote

Agora exibindo 1 - 2 de 2
Nenhuma Miniatura disponível
Nome:
license.txt
Tamanho:
1.71 KB
Formato:
Item-specific license agreed upon to submission
Descrição:
Nenhuma Miniatura disponível
Nome:
license.txt
Tamanho:
1.71 KB
Formato:
Item-specific license agreed upon to submission
Descrição:

Coleções

Artigos