The linear ordering problem with clusters: a new partial ranking

  1. Javier Alcaraz 1
  2. Eva M. García-Nové 1
  3. Mercedes Landete 1
  4. Juan F. Monge 1
  1. 1 Universidad de Alicante, España
Aldizkaria:
Top

ISSN: 1863-8279,  1134-5764

Argitalpen urtea: 2020

Alea: 28

Zenbakia: 3

Orrialdeak: 646-671

Mota: Artikulua

DOI: 10.1007/S11750-020-00552-3 DIALNET GOOGLE SCHOLAR lock_openSarbide irekia editor

Beste argitalpen batzuk: Top

Laburpena

The linear ordering problem is among core problems in combinatorial optimization. There is a squared non-negative matrix and the goal is to find the permutation of rows and columns which maximizes the sum of superdiagonal values. In this paper, we consider that columns of the matrix belong to different clusters and that the goal is to order the clusters. We introduce a new approach for the case when exactly one representative is chosen from each cluster. The new problem is called the linear ordering problem with clusters and consists of both choosing a representative for each cluster and a permutation of these representatives, so that the sum of superdiagonal values of the sub-matrix induced by the representatives is maximized. A combinatorial linear model for the linear ordering problem with clusters is given, and eventually, a hybrid metaheuristic is carefully designed and developed. Computational results illustrate the performance of the model as well as the effectiveness of the metaheuristic.

€ Ikusi finantzaketa

Finantzaketari buruzko informazioa

This work was supported by the Spanish Ministerio de Ciencia, Innovación y Universidades and Fondo Europeo de Desarrollo Regional (FEDER) through project PGC2018-099428-B-100 and by the Spanish Ministerio de Economía, Industria y Competitividad under Grant MTM2016-79765-P (AEI/FEDER, UE).

Finantzatzaile

Datuen iturria: Dialnet