Article ID: | iaor1989446 |
Country: | United States |
Volume: | 35 |
Issue: | 5 |
Start Page Number: | 709 |
End Page Number: | 717 |
Publication Date: | Oct 1989 |
Journal: | Naval Research Logistics |
Authors: | Venta Enrique R. |
This article extends the traditional median problem on a grid to include a diagonal line (e.g., a street). In contrast to the traditional median problem, this generalized problem is nonconvex and nonseparable, invalidating some of the properties on which well-known median-seeking algorithms are based. This work presents an algorithm for finding the median on this generalized grid and discusses the relationship between it and the traditional median.