it is shown in [1] that the optimal downlink radio resource allocation for non-realtime traffic in cellular cdma/tdma networks can be mapped to a multi-dimensional multiple-choice knapsack problem (mmkp) which is np-hard. in this correspondence we propose a heuristic algorithm with polynomial time complexity for this problem. numerical results indicate significant computational performance impr...

We study a dynamic allocation problem that arises in various scenarios where mobile clients joining and leaving the system have to communicate with static stations via radio transmissions. Restrictions are a maximum delay, or laxity, between consecutive client transmissions and a maximum bandwidth that a station can share among its clients. We study the problem of assigning clients to stations ...

Fleet assignment models are used by many airlines to assign aircraft to flights in a schedule to maximize profit [Abara 1986, Hane et al 1995]. A major airline reported that the use of the fleet assignment model increased annual profits by more than USD100 million [www.informs.org, 2002] a year over three years. The results of fleet assignment models affect subsequent planning, marketing and op...

In adaptive mobile network like battle fields or military applications, the base station configuration may change dynamically. Mobile nodes communicate via a base station and can move freely. This dynamic change together with the constraints make the assignment of mobile nodes to base stations difficult. In this paper, we propose the polynomial-time algorithms to find a good partitioning of mob...

We study an allocation problem that arises in various scenarios. For instance, a health monitoring system where ambulatory patients carry sensors that must periodically upload physiological data. Another example is participatory sensing, where communities of mobile device users upload periodically information about their environment. We assume that devices or sensors (generically called clients...

This paper investigates the online station assignment for (commercial) electric vehicles (EVs) that request battery swapping from a central operator, i.e., in absence of future information service has to be assigned instantly each EV upon its request. Based on EVs’ locations, availability fully-charged batteries at stations system, as well traffic conditions, aims minimize cost EVs and c...

Electrified shared mobility services need to handle charging infrastructure planning and manage their daily operations minimize total operation time cost. However, existing studies tend address these problems separately. A new online vehicle-charging assignment model is proposed integrated into the fast location problem for dynamic ridesharing using electric vehicles. The latter formulated as a...