You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/40428
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLitvinchev, I.-
dc.contributor.authorRangel, S.-
dc.contributor.authorMata, M.-
dc.contributor.authorSaucedo, J.-
dc.date.accessioned2014-05-20T15:31:14Z-
dc.date.accessioned2016-10-25T18:07:00Z-
dc.date.available2014-05-20T15:31:14Z-
dc.date.available2016-10-25T18:07:00Z-
dc.date.issued2009-06-01-
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.issn1064-2307-
dc.identifier.urihttp://hdl.handle.net/11449/40428-
dc.identifier.urihttp://acervodigital.unesp.br/handle/11449/40428-
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.sponsorshipRussian Foundation for Basic Research (RFBR)-
dc.description.sponsorshipConsejo Nacional de Ciencia y Tecnología (CONACYT)-
dc.description.sponsorshipPAICYT-
dc.format.extent363-369-
dc.language.isoeng-
dc.publisherMaik Nauka/interperiodica/springer-
dc.sourceWeb of Science-
dc.titleStudying properties of Lagrangian bounds for many-to-many assignment problemsen
dc.typeoutro-
dc.contributor.institutionUniversidade Estadual Paulista (UNESP)-
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.sponsorshipIdRFBR: 06-01-81020-Bel-a-
dc.description.sponsorshipIdCONACYT: 61343-
dc.description.sponsorshipIdCONACYT: 61903-
dc.description.sponsorshipIdPAICYT: CA 1526-07-
dc.identifier.doi10.1134/S1064230709030046-
dc.identifier.wosWOS:000267295400004-
dc.rights.accessRightsAcesso restrito-
dc.relation.ispartofJournal of Computer and Systems Sciences International-
Appears in Collections:Artigos, TCCs, Teses e Dissertações da Unesp

There are no files associated with this item.
Show simple item record Show full item record   View Statistics
 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.