Logotipo do repositório
 

Publicação:
Studying properties of Lagrangian bounds for many-to-many assignment problems

Página do item simplificado
dc.contributor.authorLitvinchev, I. [UNESP]
dc.contributor.authorRangel, S. [UNESP]
dc.contributor.authorMata, M. [UNESP]
dc.contributor.authorSaucedo, J. [UNESP]
dc.contributor.institutionUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2014-05-20T15:31:14Z
dc.date.available2014-05-20T15:31:14Z
dc.date.issued2009-06-01
dc.description.abstractClassical and modified Lagrangian bounds for the optimal value of optimization problems with a double decomposable structure are studied. For the class of many-to-many assignment problems, this property of constraints is used to design a subgradient algorithm for solving the modified dual problem. Numerical results are presented to compare the quality of classical and modified bounds, as well as the properties of the corresponding Lagrangian solutions.en
dc.description.affiliationNuevo Leon State Univ, São Paulo State Univ, Russian Acad Sci, Ctr Comp, Monterrey, Nuevo Leon, Mexico
dc.description.affiliationUnespNuevo Leon State Univ, São Paulo State Univ, Russian Acad Sci, Ctr Comp, Monterrey, Nuevo Leon, Mexico
dc.description.sponsorshipRussian Foundation for Basic Research (RFBR)
dc.description.sponsorshipConsejo Nacional de Ciencia y Tecnología (CONACYT)
dc.description.sponsorshipPAICYT
dc.description.sponsorshipIdRFBR: 06-01-81020-Bel-a
dc.description.sponsorshipIdCONACYT: 61343
dc.description.sponsorshipIdCONACYT: 61903
dc.description.sponsorshipIdPAICYT: CA 1526-07
dc.format.extent363-369
dc.identifierhttp://dx.doi.org/10.1134/S1064230709030046
dc.identifier.citationJournal of Computer and Systems Sciences International. New York: Maik Nauka/interperiodica/springer, v. 48, n. 3, p. 363-369, 2009.
dc.identifier.doi10.1134/S1064230709030046
dc.identifier.issn1064-2307
dc.identifier.urihttp://hdl.handle.net/11449/40428
dc.identifier.wosWOS:000267295400004
dc.language.isoeng
dc.publisherMaik Nauka/interperiodica/springer
dc.relation.ispartofJournal of Computer and Systems Sciences International
dc.relation.ispartofjcr0.554
dc.relation.ispartofsjr0,316
dc.rights.accessRightsAcesso restrito
dc.sourceWeb of Science
dc.titleStudying properties of Lagrangian bounds for many-to-many assignment problemsen
dc.typeArtigo
dcterms.licensehttp://www.maik.rssi.ru/cgi-perl/contents.pl?catalog=4&page=1&lang=eng
dcterms.rightsHolderMaik Nauka/interperiodica/springer
dspace.entity.typePublication

Arquivos

Licença do Pacote

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

Coleções

Artigos