| Article ID: | iaor20071613 |
| Country: | Germany |
| Volume: | 35 |
| Issue: | 2 |
| Start Page Number: | 239 |
| End Page Number: | 260 |
| Publication Date: | Oct 2006 |
| Journal: | Computational Optimization and Applications |
| Authors: | Beltran C., Tadonki C., Vial J.Ph. |
| Keywords: | -median problem |
Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a minimization problem. We study a modified Lagrangian relaxation which generates an optimal integer solution. We call it semi-Lagrangian relaxation and illustrate its practical value by solving large-scale instances of the