Matrix reordering methods for table and network visualization

M Behrisch, B Bach, N Henry Riche… - Computer Graphics …, 2016 - Wiley Online Library
This survey provides a description of algorithms to reorder visual matrices of tabular data
and adjacency matrix of Networks. The goal of this survey is to provide a comprehensive list …

Multi-objective variable neighborhood search: an application to combinatorial optimization problems

A Duarte, JJ Pantrigo, EG Pardo… - Journal of Global …, 2015 - Springer
Solutions to real-life optimization problems usually have to be evaluated considering
multiple conflicting objectives. These kind of problems, known as multi-objective …

Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization

A Duarte, J Sánchez-Oro, MGC Resende, F Glover… - Information …, 2015 - Elsevier
We propose several new hybrid heuristics for the differential dispersion problem, the best of
which consists of a GRASP with sampled greedy construction with variable neighborhood …

Parallel machine scheduling with completion-time-based criteria and sequence-dependent deterioration

J Ding, L Shen, Z Lü, B Peng - Computers & Operations Research, 2019 - Elsevier
This paper presents an ejection chain algorithm (ECA) for parallel machine scheduling
problems with sequence dependent deteriorating effects to minimize completion-time-based …

Parallel variable neighborhood search for the min–max order batching problem

B Menendez, EG Pardo… - International …, 2017 - Wiley Online Library
Warehousing is a key part of supply chain management. It primarily focuses on controlling
the movement and storage of materials within a warehouse and processing the associated …

Advanced greedy randomized adaptive search procedure for the obnoxious p-median problem

JM Colmenar, P Greistorfer, R Martí, A Duarte - European Journal of …, 2016 - Elsevier
Abstract The Obnoxious p-Median problem consists in selecting a subset of p facilities from
a given set of possible locations, in such a way that the sum of the distances between each …

An improved GRASP method for the multiple row equal facility layout problem

NR Uribe, A Herrán, JM Colmenar, A Duarte - Expert Systems with …, 2021 - Elsevier
As it is well documented in the literature, an effective facility layout design of a company
significantly increases throughput, overall productivity, and efficiency. Symmetrically, a poor …

Population-based iterated greedy algorithm for the S-labeling problem

M Lozano, E Rodriguez-Tello - Computers & Operations Research, 2023 - Elsevier
The iterated greedy metaheuristic generates a sequence of solutions by iterating over a
constructive heuristic using destruction and construction phases. In the last few years, it has …

The bandwidths of a matrix. a survey of algorithms

LO Mafteiu-Scai - Annals of West University of Timisoara-Mathematics …, 2014 - sciendo.com
The bandwidth, average bandwidth, envelope, profile and antibandwidth of the matrices
have been the subjects of study for at least 45 years. These problems have generated …

A variable neighborhood search approach for the vertex bisection problem

A Herrán, JM Colmenar, A Duarte - Information Sciences, 2019 - Elsevier
Abstract The Vertex Bisection Problem (VBP) belongs to the family of well-known graph
partitioning problems, where the main goal is to find a partition of the vertices maximizing or …