Raúl
Baños Navarro - Research interest
Spanish Version
- Combinatorial Optimization in
NP-complete problems
- Design
of heuristics for mono-objective optimization. Application to the Graph
Partitioning Problem.
- Design
of heuristics for multi-objective optimization. Application to the Graph
Partitioning Problem.
- Parallelization
of multi-objective methods: Applications.
Currently, our
research interest is focused to analyze serial and parallel heuristics
to solve NP-complete
problems. These problems are
called so due to their complexity make imposible to obtain the optimal
solution in a polinomial runtime. In order to solve this kind of
problems, it is necessary design strategies (heuristics) which
allow
the aproximation to the optimal solution. In same applications it is
neccessary to obtain a solution which satisfy not one, but a set of objectives simultaneously.
For these problems it is neccessary apply other techniques, like the Pareto-based strategies. Due to
the extreme complexity of some applications where these problems ocurr,
it is necessary the application of parallelism to reduce the runtime of
the optimization process and also to increase the quality of the
solutions.
As result of our research work, you can find
in the following link information about our publications, and also in C.Gil web page.