<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>2227-1899</journal-id>
<journal-title><![CDATA[Revista Cubana de Ciencias Informáticas]]></journal-title>
<abbrev-journal-title><![CDATA[Rev cuba cienc informat]]></abbrev-journal-title>
<issn>2227-1899</issn>
<publisher>
<publisher-name><![CDATA[Editorial Ediciones Futuro]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S2227-18992022000100062</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Determinación experimental de la influencia de la reformulación del problema RAP en su eficiencia computacional]]></article-title>
<article-title xml:lang="en"><![CDATA[Experimental determination of the influence of the reformulation of the RAP problem on its computational efficiency]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Reyna-Hernández]]></surname>
<given-names><![CDATA[Randy]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Rosete]]></surname>
<given-names><![CDATA[Alejandro]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad de Matanzas  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Cuba</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad Tecnológica de La Habana José Antonio Echeverría. Cujae  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>03</month>
<year>2022</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>03</month>
<year>2022</year>
</pub-date>
<volume>16</volume>
<numero>1</numero>
<fpage>62</fpage>
<lpage>76</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_arttext&amp;pid=S2227-18992022000100062&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_abstract&amp;pid=S2227-18992022000100062&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_pdf&amp;pid=S2227-18992022000100062&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[RESUMEN El problema de agregación de rankings (RAP, por sus siglas en inglés) busca encontrar un ranking que resuma un conjunto de ellos. Actualmente, el razonamiento sobre la base de ordenamientos o rankings ha ganado atención debido al gran número de aplicaciones para solucionar problemas de toma de decisiones y más recientemente, en informática, estadística, algebra lineal y optimización, la biología computacional entre muchas otras. Dentro del contexto de RAP se encuentra el Problema del Ranking de Kemeny (KRP), donde todos los rankings de entrada son una permutación. El KRP es NP-duro, sin embargo, existe una formulación donde, a través del método de Programación Lineal Entera (PLE) se le puede dar solución al problema. Como la eficiencia del método de PLE está dada por la cantidad de variables y restricciones, se obtuvo una reformulación del problema que permite reducir ambas dimensiones. En el presente trabajo se demuestra como la reformulación del RAP permite resolver con el mismo software instancias mayores y de resolver las mismas en menos tiempo.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[ABSTRACT The Rank Aggregation Problem (RAP) search for a ranking that summarizes a set of them. Currently, the reasoning based on rankings has gained great attention due to the large number of applications to solve decision-making problems and more recently, in computer science, statistics, linear algebra and optimization, computational biology among many others. A particular case of RAP is the Kemeny Ranking Problem (KRP), where all entry rankings are a permutation. The KRP is NP-hard, however, there is a formulation where, through the method of Integer Linear Programming (PLE), the problem can be solved. As the efficiency of the PLE method is given by the number of variables and restrictions, a reformulation of the problem was obtained that allows both dimensions to be reduced. In the present work it is demonstrated how the reformulation of the RAP allows to solve with the same software major instances and to solve them in less time.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[Agregación de Rankings]]></kwd>
<kwd lng="es"><![CDATA[Programación Lineal Entera]]></kwd>
<kwd lng="es"><![CDATA[Plugins de KNIME]]></kwd>
<kwd lng="es"><![CDATA[Problema del Ranking de Kemeny]]></kwd>
<kwd lng="en"><![CDATA[Ranking Aggregation]]></kwd>
<kwd lng="en"><![CDATA[Integer Linear Programming]]></kwd>
<kwd lng="en"><![CDATA[KNIME Plugins]]></kwd>
<kwd lng="en"><![CDATA[Kemeny Ranking Problem]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Aledo]]></surname>
<given-names><![CDATA[Juan A]]></given-names>
</name>
<name>
<surname><![CDATA[Gámez]]></surname>
<given-names><![CDATA[José A]]></given-names>
</name>
<name>
<surname><![CDATA[Rosete]]></surname>
<given-names><![CDATA[Alejandro]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Approaching Rank Aggregation Problems By Using Evolution Strategies: The Case Of The Optimal Bucket Order Problem.]]></article-title>
<source><![CDATA[European Journal Of Operational Research]]></source>
<year>2018</year>
<volume>270</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>982-98</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Aledo]]></surname>
<given-names><![CDATA[Juan A]]></given-names>
</name>
<name>
<surname><![CDATA[Gámez]]></surname>
<given-names><![CDATA[José A]]></given-names>
</name>
<name>
<surname><![CDATA[Rosete]]></surname>
<given-names><![CDATA[Alejandro]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Highly Scalable Algorithm For Weak Rankings Aggregation]]></article-title>
<source><![CDATA[Information Sciences]]></source>
<year>2021</year>
<volume>570</volume>
<page-range>144-71</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ali]]></surname>
<given-names><![CDATA[Alnur]]></given-names>
</name>
<name>
<surname><![CDATA[Meila]]></surname>
<given-names><![CDATA[Marina]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Experiments With Kemeny Ranking: What Works When?]]></article-title>
<source><![CDATA[Mathematical Social Sciences]]></source>
<year>2012</year>
<volume>64</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>28-40</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chatterjee]]></surname>
<given-names><![CDATA[Sujoy]]></given-names>
</name>
<name>
<surname><![CDATA[Mukhopadhyay]]></surname>
<given-names><![CDATA[Anirban]]></given-names>
</name>
<name>
<surname><![CDATA[Bhattacharyya]]></surname>
<given-names><![CDATA[Malay]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Weighted Rank Aggregation Approach Towards Crowd Opinion Analysis]]></article-title>
<source><![CDATA[Knowledge-Based Systems]]></source>
<year>2018</year>
<volume>149</volume>
<page-range>47-60</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Galdi]]></surname>
<given-names><![CDATA[Paola]]></given-names>
</name>
<name>
<surname><![CDATA[Fratello]]></surname>
<given-names><![CDATA[Michele]]></given-names>
</name>
<name>
<surname><![CDATA[Trojsi]]></surname>
<given-names><![CDATA[Francesca]]></given-names>
</name>
<name>
<surname><![CDATA[Russo]]></surname>
<given-names><![CDATA[Antonio]]></given-names>
</name>
<name>
<surname><![CDATA[Tedeschi]]></surname>
<given-names><![CDATA[Gioacchino]]></given-names>
</name>
<name>
<surname><![CDATA[Tagliaferri]]></surname>
<given-names><![CDATA[Roberto]]></given-names>
</name>
<name>
<surname><![CDATA[Esposito]]></surname>
<given-names><![CDATA[Fabrizio]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Stochastic Rank Aggregation For The Identification Of Functional Neuromarkers]]></article-title>
<source><![CDATA[Neuroinformatics]]></source>
<year>2019</year>
<volume>17</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>479-96</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kaur]]></surname>
<given-names><![CDATA[Parneet]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[Gai-Ge]]></given-names>
</name>
<name>
<surname><![CDATA[Singh]]></surname>
<given-names><![CDATA[Manpreet]]></given-names>
</name>
<name>
<surname><![CDATA[Singh]]></surname>
<given-names><![CDATA[Sukhwinder]]></given-names>
</name>
</person-group>
<source><![CDATA[Rank Aggregation Using Moth Search For Web.]]></source>
<year>2021</year>
<page-range>63-74</page-range><publisher-name><![CDATA[International Conference On Innovative Computing And Communications : Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="">
<collab>Konobey</collab>
<source><![CDATA[Linear Program Solver]]></source>
<year>2020</year>
</nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lestari]]></surname>
<given-names><![CDATA[Sri]]></given-names>
</name>
<name>
<surname><![CDATA[Adji]]></surname>
<given-names><![CDATA[Teguh Bharata]]></given-names>
</name>
<name>
<surname><![CDATA[Permanasari]]></surname>
<given-names><![CDATA[Adhistya Erna]]></given-names>
</name>
</person-group>
<source><![CDATA[Performance Comparison Of Rank Aggregation Using Borda And Copeland In Recommender System.]]></source>
<year>2018</year>
<page-range>69-74</page-range><publisher-name><![CDATA[Ieee]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[Yang]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[Ting-Yu]]></given-names>
</name>
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[Zhi-Yan]]></given-names>
</name>
<name>
<surname><![CDATA[Fang]]></surname>
<given-names><![CDATA[Wei]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[Chao]]></given-names>
</name>
</person-group>
<source><![CDATA[Identification Of Hub Genes In Thyroid Cancer: Robust Rank Aggregation And Weighted Gene Co-Expression Network Analysis]]></source>
<year>2019</year>
<publisher-name><![CDATA[Ssrn]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mattei]]></surname>
<given-names><![CDATA[Nicholas]]></given-names>
</name>
<name>
<surname><![CDATA[Walsh]]></surname>
<given-names><![CDATA[Toby]]></given-names>
</name>
</person-group>
<source><![CDATA[Preflib: A Library For Preferences]]></source>
<year>2013</year>
</nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Onan]]></surname>
<given-names><![CDATA[Aytu&#287;]]></given-names>
</name>
<name>
<surname><![CDATA[Koruko&#287;lu]]></surname>
<given-names><![CDATA[Serdar]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Feature Selection Model Based On Genetic Rank Aggregation For Text Sentiment Classification]]></article-title>
<source><![CDATA[Journal Of Information Science]]></source>
<year>2017</year>
<volume>43</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>25-38</page-range></nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rosete-Suárez]]></surname>
<given-names><![CDATA[Alejandro]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Reformulación Eficiente Del Problema De Programación Lineal De Agregación De Rankings]]></article-title>
<source><![CDATA[Ingeniería Industrial]]></source>
<year>2018</year>
<volume>39</volume>
<page-range>250-60</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Subochev]]></surname>
<given-names><![CDATA[Andrey]]></given-names>
</name>
<name>
<surname><![CDATA[Aleskerov]]></surname>
<given-names><![CDATA[Fuad]]></given-names>
</name>
<name>
<surname><![CDATA[Pislyakov]]></surname>
<given-names><![CDATA[Vladimir]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Ranking Journals Using Social Choice Theory Methods: A Novel Approach In Bibliometrics.]]></article-title>
<source><![CDATA[Journal Of Informetrics]]></source>
<year>2018</year>
<volume>12</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>416-29</page-range></nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tao]]></surname>
<given-names><![CDATA[Zhifu]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[Xi]]></given-names>
</name>
<name>
<surname><![CDATA[Zhou]]></surname>
<given-names><![CDATA[Ligang]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[Huayou]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Rank Aggregation Based Multi-Attribute Decision Making With Hybrid Z-Information And Its Application]]></article-title>
<source><![CDATA[Journal Of Intelligent &amp; Fuzzy Systems]]></source>
<year>2019</year>
<volume>37</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>4231-9</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="">
<collab>Universidad De Constanza</collab>
<source><![CDATA[Knime]]></source>
<year>2020</year>
</nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Xiao]]></surname>
<given-names><![CDATA[Yu]]></given-names>
</name>
<name>
<surname><![CDATA[Deng]]></surname>
<given-names><![CDATA[Ye]]></given-names>
</name>
<name>
<surname><![CDATA[Wu]]></surname>
<given-names><![CDATA[Jun]]></given-names>
</name>
<name>
<surname><![CDATA[Deng]]></surname>
<given-names><![CDATA[Hong&#8208;Zhong]]></given-names>
</name>
<name>
<surname><![CDATA[Lu]]></surname>
<given-names><![CDATA[Xin]]></given-names>
</name>
</person-group>
<source><![CDATA[Comparison Of Rank Aggregation Methods Based On Inherent Ability]]></source>
<year>2017</year>
<volume>64</volume>
<numero>7</numero>
<issue>7</issue>
<page-range>556-65</page-range><publisher-name><![CDATA[Naval Research Logistics (Nrl)]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Berlin]]></surname>
<given-names><![CDATA[Z. I]]></given-names>
</name>
</person-group>
<source><![CDATA[Scip: Solving Constraint Integer Programs]]></source>
<year>2020</year>
</nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Perny]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
<name>
<surname><![CDATA[Pirlot]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Tsoukiàs]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[(Hrsg.): Algorithmic Decision Theory -]]></article-title>
<source><![CDATA[Third International Conference, Adt 2013]]></source>
<year>2013</year>
<volume>8176</volume>
<page-range>259-70</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
