Article ID: | iaor2005860 |
Country: | Germany |
Volume: | 1 |
Issue: | 4 |
Start Page Number: | 319 |
End Page Number: | 340 |
Publication Date: | Jan 2003 |
Journal: | 4OR |
Authors: | Ceselli A. |
Keywords: | p-median problem |
The p-median problem has been widely studied in combinatorial optimisation, but its generalisation to the capacitated case has not. We propose a branch and price algorithm, comparing it with a standard MIP solver and a branch and bound algorithm based on Lagrangean relaxation. We present computational experience, using test instances drawn from the literature and new instances with higher ratio between the number of medians