Please use this identifier to cite or link to this item: https://hdl.handle.net/11000/6277
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAlcaraz Soria, Javier-
dc.contributor.authorGarcía Nové, Eva María-
dc.contributor.authorLandete, Mercedes-
dc.contributor.authorMonge Ivars, Juan Francisco-
dc.contributor.otherDepartamentos de la UMH::Estadística, Matemáticas e Informáticaes
dc.date.accessioned2020-09-02T10:14:22Z-
dc.date.available2020-09-02T10:14:22Z-
dc.date.created2020-02-29-
dc.date.issued2020-09-02-
dc.identifier.urihttp://hdl.handle.net/11000/6277-
dc.description.abstractThe 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 metaheuristices
dc.description.sponsorshipThis 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-
dc.description.sponsorshipand by the Spanish Ministerio de Economía, Industria y Competitividad under Grant MTM2016-79765-P (AEI/FEDER, UE).-
dc.formatapplication/pdfes
dc.format.extent26es
dc.language.isoenges
dc.rightsinfo:eu-repo/semantics/openAccesses
dc.subjectLinear ordering problemes
dc.subjectRank aggregation problemes
dc.subjectBucket ordering problemes
dc.subjectMetaheuristicses
dc.subject.other517 - Análisises
dc.titleThe linear ordering problem with clusters: a new partial rankinges
dc.typeinfo:eu-repo/semantics/articlees
dc.identifier.doi10.1007/s11750-020-00552-3-
dc.relation.publisherversionhttps://doi.org/10.1007/s11750-020-00552-3-
Appears in Collections:
Artículos Estadística, Matemáticas e Informática


Thumbnail

View/Open:
 21-Alcaraz2020_Article_TheLinearOrderingProblemWithCl.pdf
1,81 MB
Adobe PDF
Share:


Creative Commons ???jsp.display-item.text9???