For years, extensive research has been in the binarization of continuous metaheuristics for
solving binary-domain combinatorial problems. This paper is a continuation of a previous …

In the real world, there are a number of optimization problems whose search space is
restricted to take binary values; however, there are many continuous metaheuristics with …

In this work, an approach is proposed to solve binary combinatorial problems using
continuous metaheuristics. It focuses on the importance of binarization in the optimization …

In recent years, continuous metaheuristics have been a trend in solving binary-based
combinatorial problems due to their good results. However, to use this type of …

Global optimisation plays a critical role in today's scientific and industrial fields. Optimisation
problems are either continuous or combinatorial depending on the nature of the parameters …

Metaheuristics are smart problem solvers devoted to tackling particularly large optimization
problems. During the last 20 years, they have largely been used to solve different problems …

We present a family of local-search-based heuristics for Quadratic Unconstrained Binary
Optimization (QUBO), all of which start with a (possibly fractional) initial point, sequentially …

The Quadratic Unconstrained Binary Optimization problem (QUBO) has become a unifying
model for representing a wide range of combinatorial optimization problems, and for linking …

Binary optimization problems belong to the NP-hard class because their solutions are hard
to find in a known time. The traditional techniques could not be applied to tackle those …

Nowadays, a promising way to obtain hybrid metaheuristics concerns the combination of
several search algorithms with strong specialization in intensification and/or diversification …