Now showing items 1-6 of 6
Exact and heuristic approaches based on noninterfering transmissions for joint gateway selection, time slot allocation, routing and power control for wireless mesh networks
Wireless mesh networks (WMNs) provide cost-effective alternatives for extending wireless communication over larger geographical areas. In this paper, given a WMN with its nodes and possible wireless links, we consider the ...
A finite dominating set of cardinality O(k) and a witness set of cardinality O(n) for 1.5D terrain guarding problem
(Springer New York LLC, 2017)
1.5 dimensional (1.5D) terrain is characterized by a piecewise linear curve. Locating minimum number of guards on the terrain (T) to cover/guard the whole terrain is known as 1.5D terrain guarding problem. Approximation ...
A distance-limited continuous location-allocation problem for spatial planning of decentralized systems
We introduce a new continuous location-allocation problem where the facilities have both a fixed opening cost and a coverage distance limitation. The problem has wide applications especially in the spatial planning of water ...
A branch-and-price algorithm for the vehicle routing problem with roaming delivery locations
(Elsevier Ltd, 2017)
We study the vehicle routing problem with roaming delivery locations in which the goal is to find a least-cost set of delivery routes for a fleet of capacitated vehicles and in which a customer order has to be delivered ...
A capacitated hub location problem under hose demand uncertainty
In this study, we consider a capacitated multiple allocation hub location problem with hose demand uncertainty. Since the routing cost is a function of demand and capacity constraints are imposed on hubs, demand uncertainty ...
Routing and scheduling decisions in the hierarchical hub location problem
Hubs are facilities that consolidate and disseminate flow in many-to-many distribution systems. The hub location problem considers decisions that include the locations of hubs in a network and the allocations of demand ...