| Article ID: | iaor20011487 |
| Country: | United Kingdom |
| Volume: | 1 |
| Issue: | 4 |
| Start Page Number: | 315 |
| End Page Number: | 329 |
| Publication Date: | Jan 2000 |
| Journal: | International Journal of Mathematical Algorithms |
| Authors: | Cuninghame-Green R.A., Salhi S., Welch S.B. |
| Keywords: | location, programming: branch and bound |
A well known analytical approach which determines an optimal solution for the weighted l-maximin location problem is enhanced using two reduction tests and a suitable branch and bound scheme. These are designed to reduce the computational time without affecting the solution quality. Computational results using networks with up to 200 nodes and 9500 arcs are used to illustrate the efficiency of this analytical method.