2

Heuristics for the bi-objective diversity problem
The Max-Sum diversity and the Max-Min diversity are two well-known optimization models to capture the notion of selecting a subset of …
Citar DOI
Iterated Greedy algorithm for performing community detection in social networks
Citar DOI
Linear Layout Problems
The term layout problem comes from the context of Very Large-Scale Integration (VLSI) circuit design. Graph layouts are optimization …
Citar DOI
Multi-objective memetic optimization for the bi-objective obnoxious p-median problem
Location problems have been studied extensively in the optimization literature, the p-median being probably one of the most tackled …
Citar DOI
Scatter search for the bi-criteria p-median p-dispersion problem
The bi-criteria p-median p-dispersion is a challenging optimization problem that belongs to the family of location problems. To our …
Citar DOI
Tabu search for the dynamic bipartite drawing problem
Drawings of graphs have many applications and they are nowadays well-established tools in computer science in general, and optimization …
Citar DOI
A variable neighborhood search approach for the crew pairing problem
In this paper we propose a Variable Neighborhood Search approach for the Crew Pairing Problem. This problem consist in assigning a crew …
Citar DOI
ACO-based clustering for Ego Network analysis
The unstoppable growth of Social Networks (SNs), and the huge number of connected users, have become these networks as one of the most …
Citar DOI
Automatic procedure following evaluation using Petri net-based workflows
An operating procedure (OP), also known as checklist or action plan, is a list of actions or criteria arranged in a systematic way, …
Citar DOI
Comparative study of pheromone control heuristics in ACO algorithms for solving RCPSP problems
Constraint Satisfaction Problems (CSP) belong to a kind of traditional NP-hard problems with a high impact on both research and …
Citar DOI