Distributed hash table (DHT) based overlay networks offer an administration-free and fault-
tolerant storage space that maps" keys" to" values". For these systems to function efficiently …

Wireless ad hoc networks (WANETs) are infrastructureless networks and are used in various
applications such as habitat monitoring, military surveillance, and disaster relief. Data …

Simulated annealing technique has mostly been used to solve various optimization and
learning problems, and it is well known that the maximum clique problem is one of the most …

Nature-Inspired Computing: Physics and Chemistry-Based Algorithms provides a
comprehensive introduction to the methodologies and algorithms in nature-inspired …

It is well known that the traveling salesman problem (TSP) is one of the most studied NP-
complete problems, and evolutionary technique such as simulated annealing has mostly …

This paper presents a general kind of flow shop scheduling problem in a manufacturing
supply chain where a group of jobs can be processed on a machine simultaneously …

The minimum vertex cover problem is a well-known problem in classical graph theory. It is
known as one of the NP-Hard optimization problems, meaning that the best solution cannot …

The minimum weight vertex cover problem (MWVCP) is a fundamental combinatorial
optimization problem with various real-world applications. The MWVCP seeks a vertex cover …

In this paper, we propose a branch-and-bound algorithm to solve exactly the minimum
vertex cover (MVC) problem. Since a tight lower bound for MVC has a significant influence …

Cyber attacks on the power systems can mislead the control center to produce incorrect
state and topology estimate. State and topology attacks can have harmful impacts on the …