Comparison of Lagrangian Bounds for One Class of Generalized Assignment Problems

dc.contributorRussian Acad Sci
dc.contributorUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2014-05-20T15:31:51Z
dc.date.accessioned2022-10-05T17:06:56Z
dc.date.available2014-05-20T15:31:51Z
dc.date.available2022-10-05T17:06:56Z
dc.date.created2014-05-20T15:31:51Z
dc.date.issued2008-05-01
dc.identifierComputational Mathematics and Mathematical Physics. New York: Maik Nauka/interperiodica/springer, v. 48, n. 5, p. 739-746, 2008.
dc.identifier0965-5425
dc.identifierhttp://hdl.handle.net/11449/40884
dc.identifier10.1134/S0965542508050047
dc.identifierWOS:000262334100004
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/3911831
dc.description.abstractClassical and modified Lagrangian bounds for the optimal value of optimization problems with a double decomposable structure are examined. For the class of generalized assignment problems, this property of constraints is used to design a Benders algorithm for solving the modified dual problem. Numerical results are presented that compare the quality of classical and modified bounds.
dc.languageeng
dc.publisherMaik Nauka/interperiodica/springer
dc.relationComputational Mathematics and Mathematical Physics
dc.relation0.677
dc.relation0,421
dc.rightsAcesso restrito
dc.sourceWeb of Science
dc.subjectLagrangian bounds in optimization problems
dc.subjectimprovement of Lagrangian bounds
dc.subjectgeneralized assignment problem
dc.titleComparison of Lagrangian Bounds for One Class of Generalized Assignment Problems
dc.typeArtigo


Este ítem pertenece a la siguiente institución