Search
Now showing items 1-3 of 3
Un Algoritmo Evolutivo para Resolver el Problema de Coloración Robusta
Un Algoritmo Evolutivo para Resolver el Problema de Coloración Robusta
(2012-03-22)
Let G and \bar{G} be two complementary graphs. Given a penalty function defined over the edges of \bar{G}, it is said that the rigidity of a k-coloring of G is the summation ofthe penalties of the edges of G that join ...
Heuristics for the Robust Coloring Problem
Heurísticas para el Problema de Coloracion Robusta
(2011-03-18)
Let $G$ and $\bar{G}$ be complementary graphs. Given a penalty function defined on the edges of $G$, we will say that the rigidity of a $k$-coloring of $G$ is the sum of the penalties of the edges of G joining vertices of ...
An optimization algorithm inspired by musical composition in constrained optimization problems
Un algoritmo de optimización inspirado en composición musical para el problema de optimización con restricciones
(2013-08-29)
Many real-world problems can be expressed as an instance of the constrained nonlinear optimization problem (CNOP). This problem has a set of constraints specifies the feasible solution space. In the last years several ...