| dc.contributor | Universidade Estadual Paulista (UNESP) | |
| dc.creator | Litvinchev, I. S. | |
| dc.creator | Rangel, S. | |
| dc.date | 2014-05-20T15:31:51Z | |
| dc.date | 2016-10-25T18:07:50Z | |
| dc.date | 2014-05-20T15:31:51Z | |
| dc.date | 2016-10-25T18:07:50Z | |
| dc.date | 2008-05-01 | |
| dc.date.accessioned | 2017-04-06T00:24:26Z | |
| dc.date.available | 2017-04-06T00:24:26Z | |
| dc.identifier | Computational Mathematics and Mathematical Physics. New York: Maik Nauka/interperiodica/springer, v. 48, n. 5, p. 739-746, 2008. | |
| dc.identifier | 0965-5425 | |
| dc.identifier | http://hdl.handle.net/11449/40884 | |
| dc.identifier | http://acervodigital.unesp.br/handle/11449/40884 | |
| dc.identifier | 10.1134/S0965542508050047 | |
| dc.identifier | WOS:000262334100004 | |
| dc.identifier | http://dx.doi.org/10.1134/S0965542508050047 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/883622 | |
| dc.description | Classical 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.description | Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) | |
| dc.language | eng | |
| dc.publisher | Maik Nauka/interperiodica/springer | |
| dc.relation | Computational Mathematics and Mathematical Physics | |
| dc.rights | info:eu-repo/semantics/closedAccess | |
| dc.subject | Lagrangian bounds in optimization problems | |
| dc.subject | improvement of Lagrangian bounds | |
| dc.subject | generalized assignment problem | |
| dc.title | Comparison of Lagrangian Bounds for One Class of Generalized Assignment Problems | |
| dc.type | Otro | |
