Solving the p-Median Problem with a Semi-Lagrangian Relaxation
- First Online:
- 338 Downloads
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 p-median problem.
KeywordsLagrangian relaxation combinatorial optimization p-median problem
Unable to display preview. Download preview PDF.