Abstract Mobile Ad-Hoc Networks are currently experiencing a second youth in terms of research interest as well providing benefits to our society. Clearly, this has been fostered by the wide range applications that have become actually feasible thanks pervasive and increasing presence smartphones, drones, sensors other small devices with communication sensing capability. Aiming deploy solutions...

Retailers’ efforts to monetize consumer location data remain dominated by inefficient protocols (e.g., geofencing) that customize marketing interactions based solely on app users’ current location. Although extant trajectory mining techniques can remedy these shortcomings, they require high-frequency data, which poses severe risks consumers’ privacy. The authors present a novel method extract v...

This paper considers the k-sink location problem in dynamic path networks. In our model, a dynamic path network consists of an undirected path with positive edge lengths, uniform edge capacity, and positive vertex supplies. Here, each vertex supply corresponds to a set of evacuees. Then, the problem requires to find the optimal location of k sinks in a given path so that each evacuee is sent to...

Dynamic eet management problems are normally formulated as networks over dynamic networks. Additional realism usually implies the inclusion of complicating constraints, typically producing exceptionally large integer programs. In this paper, we present for the rst time the formulation of dynamic eet management problems in an optimal control setting, using a novel formulation called a Logistics ...

We study the capacitated k-facility location problem, in which we are given a set of clients with demands, a set of facilities with capacities and a constant number k. It costs fi to open facility i, and cij for facility i to serve one unit of demand from client j. The objective is to open at most k facilities serving all the demands and satisfying the capacity constraints while minimizing the ...

Dynamic network flow problems have wide applications in evacuation planning. From a given subset of arcs directed network, choosing the suitable for facility location with objective is very important optimization emergency cases. Because decrease capacity an arc by placing it, there may be reduction maximum or increase quickest time. In this work, we consider proble...