Comparison of Lagrangian Bounds for One Class of Generalized Assignment Problems
Loading...
Files
External sources
External sources
Date
Authors
Advisor
Coadvisor
Graduate program
Undergraduate course
Journal Title
Journal ISSN
Volume Title
Publisher
Maik Nauka/interperiodica/springer
Type
Article
Access right
Acesso restrito
Files
External sources
External sources
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.
Description
Keywords
Lagrangian bounds in optimization problems, improvement of Lagrangian bounds, generalized assignment problem
Language
English
Citation
Computational Mathematics and Mathematical Physics. New York: Maik Nauka/interperiodica/springer, v. 48, n. 5, p. 739-746, 2008.
