— Computational complexity is a major challenge in evolutionary algorithms due to their need for repeated fitness function evaluations. Here, we aim to reduce number of fitness f...
Mohsen Davarynejad, Mohammad R. Akbarzadeh-Totonch...
The Lov´asz theta number of a graph G can be viewed as a semidefinite programming relaxation of the stability number of G. It has recently been shown that a copositive strengthe...
This paper presents a study aimed to the realization of a novel
multiresolution registration framework. The transformation
function is computed iteratively as a composition of lo...
Global competition has given rise to Logistic and Production Systems (LPSs), that are distributed manufacturing systems integrating international logistics and information technol...
Mariagrazia Dotoli, Maria Pia Fanti, Agostino Marc...
This paper uses a constraint set approach to linear programming problems with equality constraints whose coefficients and/or right-hand side values could be uncertain. We consider ...