A review of graph approaches to network security analytics

S Noel - From Database to Cyber Security: Essays Dedicated to …, 2018 - Springer
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 …

Research on location selection model of distribution network with constrained line constraints based on genetic algorithm

K Guo - Neural Computing and Applications, 2020 - Springer
With the rapid rise of the Internet, China's e-commerce has also flourished. The development
of e-commerce has led to an increase in the volume of logistics and distribution. The further …

On the optimal placement of cameras for surveillance and the underlying set cover problem

J Kritter, M Brévilliers, J Lepagnot, L Idoumghar - Applied Soft Computing, 2019 - Elsevier
Given a delimited surveillance area, represented in either 2D or 3D, and a set of feasible
camera locations and orientations, the optimal camera placement problem (OCP) is that of …

A clustering algorithm applied to the binarization of swarm intelligence continuous metaheuristics

J García, B Crawford, R Soto, G Astorga - Swarm and evolutionary …, 2019 - Elsevier
The binarization of Swarm intelligence continuous metaheuristics is an area of great interest
in operations research. This interest is mainly due to the application of binarized …

A Db‐Scan Binarization Algorithm Applied to Matrix Covering Problems

J García, P Moraga, M Valenzuela… - Computational …, 2019 - Wiley Online Library
The integration of machine learning techniques and metaheuristic algorithms is an area of
interest due to the great potential for applications. In particular, using these hybrid …

NuSC: an effective local search algorithm for solving the set covering problem

C Luo, W Xing, S Cai, C Hu - IEEE transactions on cybernetics, 2022 - ieeexplore.ieee.org
The set covering problem (SCP) is a fundamental NP-hard problem in computer science and
has a broad range of important real-world applications. In practice, SCP instances …

A Binary Cuckoo Search Big Data Algorithm Applied to Large‐Scale Crew Scheduling Problems

J García, F Altimiras, A Peña, G Astorga… - Complexity, 2018 - Wiley Online Library
The progress of metaheuristic techniques, big data, and the Internet of things generates
opportunities to performance improvements in complex industrial systems. This article …

A multi dynamic binary black hole algorithm applied to set covering problem

J García, B Crawford, R Soto, P García - Harmony Search Algorithm …, 2017 - Springer
The set covering problem seeks for minimum cost family of subsets from n given subsets,
which together covers the complete set. In this article, we present multi dynamic binary black …

A novel local search for unicost set covering problem using hyperedge configuration checking and weight diversity

Y Wang, D Ouyang, L Zhang… - Science China …, 2017 - search.proquest.com
The unicost version of well-known set covering problem (SCP) is central to a wide variety of
practical applications for which finding an optimal solution quickly is crucial. In this paper, we …

A four-stage branch local search algorithm for minimal test cost attribute reduction based on the set covering

H Su, J Chen, Y Lin - Applied Soft Computing, 2024 - Elsevier
Attribute reduction is a fundamental problem in rough set theory and serves as an effective
data reduction technique. The minimal test cost attribute reduction problem poses a more …