Utilize este identificador para citar ou criar um link para este item:
http://acervodigital.unesp.br/handle/11449/40884- Título:
- Comparison of Lagrangian Bounds for One Class of Generalized Assignment Problems
- Russian Acad Sci
- Universidade Estadual Paulista (UNESP)
- 0965-5425
- Russian Foundation for Basic Research (RFBR)
- Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
- RFBR: 06-01-81020-Bel-a
- CNPq: 473001/2004-7
- 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.
- 1-Mai-2008
- Computational Mathematics and Mathematical Physics. New York: Maik Nauka/interperiodica/springer, v. 48, n. 5, p. 739-746, 2008.
- 739-746
- Maik Nauka/interperiodica/springer
- Lagrangian bounds in optimization problems
- improvement of Lagrangian bounds
- generalized assignment problem
- http://dx.doi.org/10.1134/S0965542508050047
- Acesso restrito
- outro
- http://repositorio.unesp.br/handle/11449/40884
Não há nenhum arquivo associado com este item.
Itens do Acervo digital da UNESP são protegidos por direitos autorais reservados a menos que seja expresso o contrário.