Comparison of Lagrangian Bounds for One Class of Generalized Assignment Problems

Litvinchev, I. S.; Rangel, S.

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/40884

Title:

Comparison of Lagrangian Bounds for One Class of Generalized Assignment Problems

Author(s):

Institution:

Russian Acad Sci
Universidade Estadual Paulista (UNESP)

ISSN:

0965-5425

Sponsorship:

Russian Foundation for Basic Research (RFBR)
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Sponsorship Process Number:

RFBR: 06-01-81020-Bel-a
CNPq: 473001/2004-7

Abstract:

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.

Issue Date:

1-May-2008

Citation:

Computational Mathematics and Mathematical Physics. New York: Maik Nauka/interperiodica/springer, v. 48, n. 5, p. 739-746, 2008.

Time Duration:

739-746

Publisher:

Maik Nauka/interperiodica/springer

Keywords:

Lagrangian bounds in optimization problems
improvement of Lagrangian bounds
generalized assignment problem

Source:

http://dx.doi.org/10.1134/S0965542508050047

URI:

Access Rights:

Acesso restrito

Type:

outro

Source:

http://repositorio.unesp.br/handle/11449/40884

Artigos, TCCs, Teses e Dissertações da Unesp

There are no files associated with this item.

Show full item record View Statistics