| Article ID: | iaor200971621 |
| Country: | Belgium |
| Volume: | 17 |
| Issue: | 1 |
| Start Page Number: | 61 |
| End Page Number: | 78 |
| Publication Date: | Oct 2009 |
| Journal: | Studies in Locational Analysis |
| Authors: | Dearing P M |
An algebraic replacement rule is presented for the dual algorithm for solving the one-center location problem, also called the Euclidean distance mini-max location problem. The algebraic replacement rule is an improvement over existing replacement rules for the problem with weighted distance, and is shown to be equivalent to the geometric replacement rule of Elzinga-Hearn for the un-weighted problem.