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 …

The application of continuous metaheuristic algorithms to combinatorial problems is an area
of interest at the engineering level. This interest is related to the fact that many of the …

At the business level, there are a large number of combinatorial problems. A subset of these
is NP-hard type. The study of algorithms that address this type of problem is of great interest …

In the industry, the need for optimization naturally arises, with which there is a large number
of optimization problems, particularly combinatorial and NP-hard type. Therefore, there is an …

In the fields of engineering and science, there are many combinatorial optimization
problems. Many of these problems are NP-hard problems, which are difficult to solve with …

The NP-hard problems are of interest in operations research and particularly the
combinatorial problems. Therefore, the design of efficient algorithms that address these …

A novel prefabricated strengthening structure (NPSS) is proposed to improve the vertical
stiffness and load-bearing capacity of existing short-span bridges for heavier axle-load trains …

Combinatorial optimization problems appear frequently in the areas of engineering and
science. A significant number of these problems are of the NP-hard type, therefore when the …

The design of robust continuous metaheuristic techniques to apply them to combinatorial
problems is a line of research with great applied potential. There are two major challenges …

Combinatorial and particularly combinatorial NP-hard problems are of importance and
interest in operations research. Therefore, the design of efficient algorithms that address …