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 …

The set covering problem is a fundamental model which comprises a wide range of
important applications such as crew scheduling problems that need to cover a set of trips. It …

When we face real problems using computational resources, we understand that it is
common to find combinatorial problems in binary domains. Moreover, we have to take into …

Combinatorial optimization problems are very common in the real world but difficult to solve.
Among the promising algorithms that have been successful in solving these problems are …

The high computational capacity that we have thanks to the new technologies allows us to
communicate two great worlds such as optimization methods and machine learning. The …

Multi-armed bandit (MAB) is a well-known reinforcement learning algorithm that has shown
outstanding performance for recommendation systems and other areas. On the other hand …

As is well known in the scientific community, optimization problems are becoming
increasingly common, complex, and difficult to solve. The use of metaheuristics to solve …

Практична цінність отриманих результатів полягає у тому, що запропонований новий
підхід до використання локального пошуку, базованого на статистичних оцінках …

The high computational capacity that we have thanks to the new technologies allows us to
communicate two great worlds such as optimization methods and machine learning. The …