Improved Lagrangean Decomposition: An Application to the Generalized Assignment Problem

Bárcia, Paulo; Jornsten, Kurt

http://hdl.handle.net/10362/84564

Utilize este identificador para referenciar este registo.

Nome:	Descrição:	Tamanho:	Formato:
WP116.pdf		353.72 KB	Adobe PDF	Ver/Abrir

Contacte-nos

Autores

Bárcia, Paulo

Jornsten, Kurt

Resumo(s)

Recently two new ways of obtaining improved Lagrangean bounds have been suggested: Lagrangean decomposition and bound improving sequences. In this work we will obtain a Lagrangean approach combining the two ideas mentioned above. We provide theoretical results about the sharpness of the bounds obtained by the combined approach for the general case and an application to the generalized assignment problem. Computational experience is reported.

Palavras-chave

Integer programming Lagrange multipliers Assignement

URI

http://hdl.handle.net/10362/84564

Citação

Bárcia, Paulo and Jornsten, Kurt, Improved Lagrangean Decomposition: An Application to the Generalized Assignment Problem (April, 1989). FEUNL Working Paper Series No. 116

Editora

Nova SBE

Coleções

NSBE - Working Paper Series

Ver registo completo