Comparison of Lagrangian Bounds for One Class of Generalized Assignment Problems
| Contribuinte(s) |
Universidade Estadual Paulista (UNESP) |
|---|---|
| Data(s) |
20/05/2014
20/05/2014
01/05/2008
|
| Resumo |
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) 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. |
| Formato |
739-746 |
| Identificador |
http://dx.doi.org/10.1134/S0965542508050047 Computational Mathematics and Mathematical Physics. New York: Maik Nauka/interperiodica/springer, v. 48, n. 5, p. 739-746, 2008. 0965-5425 http://hdl.handle.net/11449/40884 10.1134/S0965542508050047 WOS:000262334100004 |
| Idioma(s) |
eng |
| Publicador |
Maik Nauka/interperiodica/springer |
| Relação |
Computational Mathematics and Mathematical Physics |
| Direitos |
closedAccess |
| Palavras-Chave | #Lagrangian bounds in optimization problems #improvement of Lagrangian bounds #generalized assignment problem |
| Tipo |
info:eu-repo/semantics/article |
