Por favor, use este identificador para citar o enlazar este ítem:
https://hdl.handle.net/11000/6277
The linear ordering problem with clusters: a new partial ranking
Título : The linear ordering problem with clusters: a new partial ranking |
Autor : Alcaraz Soria, Javier García Nové, Eva María Landete, Mercedes Monge Ivars, Juan Francisco |
Departamento: Departamentos de la UMH::Estadística, Matemáticas e Informática |
Fecha de publicación: 2020-02-29 |
URI : http://hdl.handle.net/11000/6277 |
Resumen :
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
|
Palabras clave/Materias: Linear ordering problem Rank aggregation problem Bucket ordering problem Metaheuristics |
Área de conocimiento : Análisis |
Tipo de documento : info:eu-repo/semantics/article |
Derechos de acceso: info:eu-repo/semantics/openAccess |
DOI : https://doi.org/10.1007/s11750-020-00552-3 |
Aparece en las colecciones: Artículos Estadística, Matemáticas e Informática
|
La licencia se describe como: Atribución-NonComercial-NoDerivada 4.0 Internacional.