In this study, we review the covering problems in facility location. Here, besides a number of
reviews on covering problems, a comprehensive review of models, solutions and …

This newly expanded and updated second edition of the best-selling classic continues to
take the" mystery" out of designing algorithms, and analyzing their efficacy and efficiency …

We propose a dual-resolution scheme to achieve time-efficient autonomous exploration with
one or many robots. The scheme maintains a high-resolution local map of the robot's …

In this paper we present a genetic algorithm-based heuristic for non-unicost set covering
problems. We propose several modifications to the basic genetic procedures including a …

In this paper, we study the performance of route query control mechanisms for the recently
proposed Zone Routing Protocol (ZRP) for ad-hoc networks. The ZRP proactively maintains …

In-network data aggregation is essential for wireless sensor networks where energy
resources are limited. In a previously proposed data dissemination scheme (directed …

We look into the realization of mobile crowdsensing campaigns that draw on the
opportunistic networking paradigm, as practised in delay-tolerant networks but also in the …

Global optimization solves real-world problems numerically or analytically by minimizing
their objective functions. Most of the analytical algorithms are greedy and computationally …

There is a line of research extending over the last 20+ years applying graph-based methods
for assessing and improving the security of operational computer networks, maintaining …

In this study, we present exact and heuristics algorithms for a traffic sensors location problem
called the screen line problem. It is a problem of how to locate traffic sensors on a …