Weighting-based parallel local search for optimal camera placement and unicost set covering

This paper presents a weighting-based parallel local search algorithm (WPLS) for solving the optimal camera placement problem (OCP) and the unicost set covering problem (USCP). The neighborhood exploration of WPLS is parallelizable and hence can be accelerated using parallel computing architectures such as multi-core CPU or GPGPU.