Improved Lagrangean decomposition: An application to the generalized assignment problem

Paulo Bárcia, Kurt Jörnsten

Research output: Contribution to journalArticle

22 Citations (Scopus)

Abstract

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. Theoretical results are provided about the sharpness of the bounds obtained by the combined approach for the general case as well as an application to the generalized assignment problem. Computational experience is reported.

Original languageEnglish
Pages (from-to)84-92
Number of pages9
JournalEuropean Journal of Operational Research
Volume46
Issue number1
DOIs
Publication statusPublished - 4 May 1990

Keywords

  • assignment
  • Integer programming
  • Lagrange multipliers

Fingerprint Dive into the research topics of 'Improved Lagrangean decomposition: An application to the generalized assignment problem'. Together they form a unique fingerprint.

  • Cite this