Improved Lagrangean Decomposition: An Application to the Generalized Assignment Problem
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 obtai...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | workingPaper |
| Language: | eng |
| Published: |
2019
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10362/84564 |
| Country: | Portugal |
| Oai: | oai:run.unl.pt:10362/84564 |
| Summary: | 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. |
|---|