1

Design of japanese tree frog algorithm for community finding problems
Community Finding Problems (CFPs) have become very popular in the last years, due to the high number of users that connect everyday to …
Citar DOI
Detecting Weak Points in Networks Using Variable Neighborhood Search
Citar DOI
Encontrando grafos bipartitos completos mediante Busqueda de Vecindad Variable
El Problema del Maximo Biclique Balanceado, o Maximum Balanced Biclique Problem (MBBP), consiste ennencontrar el biclique de tamano …
Citar
Finding balanced bicliques in bipartite graphs using variable neighborhood search
The Maximum Balanced Biclique Problem (MBBP) consists of identifying a complete bipartite graph, or biclique, of maximum size within an …
Citar DOI
GRASP with Path Relinking for 2D-Bandwidth Minimization Problem
The graph bandwidth minimization problem is an interesting problem that has become relevant in a wide range of domains. Networks …
Citar DOI
How to Locate Disperse Obnoxious Facility Centers?
The bi-objective obnoxious p-median problem has not been extensively studied in the literature yet, even having an enormous real …
Citar DOI
Mejorando la acción docente con la metodología Smart tutor
Citar
New VNS Variants for the Online Order Batching Problem
The Order Batching Problem (OBP) can be considered a family of optimization problems related to the retrieval of goods in a warehouse. …
Citar DOI
Un estudio sobre la influencia de la funcion objetivo en evolucion gramatical para regresion simbolica
—La evolucion gramatical es una variante ´ de la programacion gen ´ etica, que permite, entre otras ´ caracter´ısticas, introducir …
Citar
Where facility centers should be located?
Facility location problems aim to determine the best position to place facility centers. This task is not easy since many objectives …
Citar