2

Strategic oscillation for the balanced minimum sum-of-squares clustering problem
In the age of connectivity, every person is constantly producing large amounts of data every minute: social networks, information about …
Citar DOI
The capacitated dispersion problem: an optimization model and a memetic algorithm
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, and the growing interest of …
Citar DOI
Two-dimensional bandwidth minimization problem: Exact and heuristic approaches
Reducing the bandwidth in a graph is an optimization problem which has generated significant attention over time due to its practical …
Citar DOI
A general variable neighborhood search for solving the multi-objective open vehicle routing problem
The multi-objective open vehicle routing problem (MO-OVRP) is a variant of the classic vehicle routing problem in which routes are not …
Citar DOI
A parallel variable neighborhood search approach for the obnoxious p-median problem
The obnoxious p-median problem consists of selecting p locations, considered facilities, in a way that the sum of the distances from …
Citar DOI
An efficient metaheuristic for the K-page crossing number minimization problem
Graph layout problems refer to a family of optimization problems with relevant applications in VLSI design, information retrieval, …
Citar DOI
Basic variable neighborhood search for the minimum sitting arrangement problem
The minimum sitting arrangement (MinSA) problem is a linear layout problem consisting in minimizing the number of errors produced when …
Citar DOI
Conformance checking for time-series-aware processes
This article tackles the problem of checking the conformance between a business process model and the data produced by its execution in …
Citar DOI
Determination and analysis of ionization/excitation distributions for alpha particles in silicon detectors
As known, the detector response function in the detection of alpha particles is characterized by the following distributions: …
Citar DOI
Finding weaknesses in networks using greedy randomized adaptive search procedure and path relinking
In recent years, the relevance of cybersecurity has been increasingly evident to companies and institutions, as well as to final users. …
Citar DOI