1

Búsqueda de vecindad variable para el problema de la agrupación y recogida de pedidos online en almacenes logísticos
En este trabajo se presenta la adaptación de un algoritmo de Búsqueda de Vecindad Variable Básica al problema de agrupación y recogida …
Cite
Design of an ACO algorithm for Solving Community Finding Problems
The amount of data generated by social media users is increasing exponentially mainly produced by the high number of users connected …
Cite
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 …
Cite DOI
Detecting Weak Points in Networks Using Variable Neighborhood Search
Cite 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 …
Cite
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 …
Cite 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 …
Cite 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 …
Cite DOI
Mejorando la acción docente con la metodología Smart tutor
Cite
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. …
Cite DOI