ABSTRACT
In this chapter, we consider a class of queries that arise in spatial decision making and resource allocation applications. Assume that a company wants to open a number of warehouses in a city. Let P be the set of residential blocks in the city. P represents customer locations to be potentially served by the company. At the same time, P also comprises the candidate warehouse locations because the warehouses themselves must be opened in some residential blocks. In this context, an analyst may ask any of the following questions:
Q1. k-Medoid query: If the number k of warehouses is known, in which residential blocks should they be opened, so that the average distance from each location in P to its closest warehouse is minimized?
