This paper introduces a general modeling framework for multi-type maximal covering location problem in which the position of facilities different normed spaces are simultaneously decided to maximize demand generated by set points. From need intertwining decisions discrete and continuous sets, hybridized is considered some types be located finite sets others spaces. A natural non-linear model pr...

This paper considers the maximum coverage location problem (MCLP) in a continuous formulation. It is assumed that domain and family of geometric objects arbitrary shape are specified. necessary to find such cover greatest possible amount domain. A mathematical model MCLP proposed form an unconstrained nonlinear optimization problem. Python computational geometry packages were used calculate are...

Continuous location-dependent queries are key elements for the development of locationbased and context-aware services. While most work on location-dependent query processing has been mainly oriented towards outdoor environments, this paper develops an approach for the continuous processing of location-dependent queries over indoor moving objects. A prototype for handling those queries has been...

A k nearest neighbor (k-NN) query retrieves k objects in a given objects set which are closest to the query point q. Processing continuous k-nearest neighbor (k-NN) query over moving objects in location-dependent application requires that the frequent location updates of moving objects and intensive continuous k-NN queries must be efficiently processed at the same time. In this paper, we propos...