<?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>1815-5936</journal-id>
<journal-title><![CDATA[Ingeniería Industrial]]></journal-title>
<abbrev-journal-title><![CDATA[Ing. Ind.]]></abbrev-journal-title>
<issn>1815-5936</issn>
<publisher>
<publisher-name><![CDATA[Facultad de Ingeniería Industrial, Instituto Superior Politécnico José Antonio Echeverría, Cujae.]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1815-59362018000300250</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Reformulación eficiente del problema de programación lineal de agregación de rankings]]></article-title>
<article-title xml:lang="en"><![CDATA[Efficient reformulation of the linear programming rank aggregation problem]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Rosete-Suárez]]></surname>
<given-names><![CDATA[Alejandro]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Tecnológica de La Habana José Antonio Echeverría  ]]></institution>
<addr-line><![CDATA[ La Habana]]></addr-line>
<country>Cuba</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>12</month>
<year>2018</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>12</month>
<year>2018</year>
</pub-date>
<volume>39</volume>
<numero>3</numero>
<fpage>250</fpage>
<lpage>260</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_arttext&amp;pid=S1815-59362018000300250&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_abstract&amp;pid=S1815-59362018000300250&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://scielo.sld.cu/scielo.php?script=sci_pdf&amp;pid=S1815-59362018000300250&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[RESUMEN Los rankings son muy utilizados para expresar distintos tipos de preferencias, en ramas tan diversas como la música, el deporte, la política, etc. El problema de agregación de rankings consiste en encontrar la permutación que mejor resume a un conjunto de rankings de entrada, minimizando la distancia de Kendall. Existe una formulación de programación lineal entera para este problema que permite su resolución de forma exacta si se cuenta con los recursos computacionales necesarios. En este trabajo se presenta una nueva formulación de programación lineal entera del problema de agregación de rankings que permite reducir las variables a la mitad y la cantidad de restricciones a un tercio aproximadamente. Esto permite resolver los mismos problemas con mucha mayor eficiencia computacional.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[ABSTRACT Rankings are very commonly used to express preferences in music, sports, politics and other diverse fields. The Rank Aggregation Problem consists on finding the permutation that best represents a set of input rankings, by minimizing the Kendall distance. There is an Integer Linear Programming formulation for this problem that allows solving it in an exact way, if computational resources are available. In this paper we introduce a new Integer Linear Programming formulation of the Rank Aggregation Problem that allows reducing the number of variables by half and the amount of constraints approximately to a third part. This reduction allows solving the same problems with an improved computational efficiency.]]></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[distancia de Kendall]]></kwd>
<kwd lng="en"><![CDATA[rank aggregation]]></kwd>
<kwd lng="en"><![CDATA[integer linear programming]]></kwd>
<kwd lng="en"><![CDATA[Kendall distance]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="">
<collab>REAL ACADEMIA ESPAÑOLA</collab>
<source><![CDATA[Diccionario de la Lengua Española]]></source>
<year>2018</year>
</nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dwork]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
<name>
<surname><![CDATA[Kumar]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
<name>
<surname><![CDATA[Naor]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<source><![CDATA[Aggregation Methods for the Web]]></source>
<year></year>
<conf-name><![CDATA[ 10thInternational Conference on World Wide Web]]></conf-name>
<conf-loc>Hong Kong, China </conf-loc>
<page-range>613-22</page-range></nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Aledo]]></surname>
<given-names><![CDATA[JA]]></given-names>
</name>
<name>
<surname><![CDATA[Gámez]]></surname>
<given-names><![CDATA[JA]]></given-names>
</name>
<name>
<surname><![CDATA[Molina]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Tackling the Rank Aggregation Problem with Evolutionary Algorithms]]></article-title>
<source><![CDATA[Applied Mathematics and Computation]]></source>
<year>2013</year>
<numero>222</numero>
<issue>222</issue>
<page-range>632-44</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kemeny]]></surname>
<given-names><![CDATA[JL]]></given-names>
</name>
<name>
<surname><![CDATA[Snell]]></surname>
<given-names><![CDATA[JG]]></given-names>
</name>
</person-group>
<source><![CDATA[Mathematical Models in the Social Sciences]]></source>
<year>1962</year>
<publisher-loc><![CDATA[Blaisdell, New York ]]></publisher-loc>
<publisher-name><![CDATA[MIT Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kendall]]></surname>
<given-names><![CDATA[MG]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A New Measure of Rank Correlation]]></article-title>
<source><![CDATA[Biometrika]]></source>
<year>1938</year>
<numero>30</numero>
<issue>30</issue>
<page-range>81-93</page-range></nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Borda]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Memoire Sur Les Elections Au Scrutin]]></article-title>
<source><![CDATA[Histoire De L'academie Royal Des Sciences]]></source>
<year>1781</year>
<numero>4</numero>
<issue>4</issue>
</nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Emerson]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The Original Borda Count And Partial Voting]]></article-title>
<source><![CDATA[Social Choice and Welfare]]></source>
<year>2013</year>
<numero>40</numero>
<issue>40</issue>
<page-range>353-8</page-range></nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mattei]]></surname>
<given-names><![CDATA[N]]></given-names>
</name>
<name>
<surname><![CDATA[Walsh]]></surname>
<given-names><![CDATA[T]]></given-names>
</name>
</person-group>
<source><![CDATA[Preflib: A Library For Preferences]]></source>
<year></year>
<conf-name><![CDATA[ Actas Algorithmic Decision Theory: Third International Conference]]></conf-name>
<conf-loc>Bruxelles, Belgium </conf-loc>
<page-range>259-70</page-range></nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bello]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Lugo]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
<name>
<surname><![CDATA[García]]></surname>
<given-names><![CDATA[MM]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Un método para la generación de rankings en la selección de equipos de trabajo en ambiente competitivo basado en algoritmos genéticos]]></article-title>
<source><![CDATA[Revista Cubana de Ciencias Informáticas]]></source>
<year>2016</year>
<volume>10</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>196-210</page-range></nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nápoles]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
<name>
<surname><![CDATA[Dikopoulou]]></surname>
<given-names><![CDATA[Z]]></given-names>
</name>
<name>
<surname><![CDATA[Papageorgiou]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Prototypes Construction From Partial Rankings To Characterize The Attractiveness Of Companies In Belgium]]></article-title>
<source><![CDATA[Applied Soft Computing]]></source>
<year>2016</year>
<numero>42</numero>
<issue>42</issue>
<page-range>276-89</page-range></nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Aledo]]></surname>
<given-names><![CDATA[JA]]></given-names>
</name>
<name>
<surname><![CDATA[Gámez]]></surname>
<given-names><![CDATA[JA]]></given-names>
</name>
<name>
<surname><![CDATA[Molina]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Consensus-based journal rankings: a complementary tool for bibliometric evaluation]]></article-title>
<source><![CDATA[Journal of the Association for Information Science and Technology]]></source>
<year>2018</year>
<volume>69</volume>
<numero>7</numero>
<issue>7</issue>
<page-range>936-48</page-range></nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Aledo]]></surname>
<given-names><![CDATA[JA]]></given-names>
</name>
<name>
<surname><![CDATA[Gámez]]></surname>
<given-names><![CDATA[JA]]></given-names>
</name>
<name>
<surname><![CDATA[García-Borroto]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<source><![CDATA[Obtención de rankings de consenso para comparar opiniones de profesores y estudiantes sobre el proceso de formación]]></source>
<year></year>
<conf-name><![CDATA[ IIICongreso de Ingeniería Informática y Sistemas de Información, CIIISI&#8217;2016, Convención científica de ingeniería y arquitectura de la Cujae]]></conf-name>
<conf-loc>La Habana, Cuba </conf-loc>
</nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ali]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Meila]]></surname>
<given-names><![CDATA[M]]></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>
<numero>64</numero>
<issue>64</issue>
<page-range>28-40</page-range></nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Conitzer]]></surname>
<given-names><![CDATA[V]]></given-names>
</name>
<name>
<surname><![CDATA[Davenport]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Kalagnanam]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<source><![CDATA[Improved bounds for computing Kemeny rankings]]></source>
<year>2006</year>
<page-range>620-7</page-range><publisher-loc><![CDATA[Boston, MA ]]></publisher-loc>
<publisher-name><![CDATA[AAAI]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Schalekampf]]></surname>
<given-names><![CDATA[F]]></given-names>
</name>
<name>
<surname><![CDATA[Van Zuylen]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<source><![CDATA[Rank aggregation: together we&#8217;re strong]]></source>
<year></year>
<conf-name><![CDATA[ 11thSIAM Workshop on Algorithm Engineering and Experiments]]></conf-name>
<conf-loc>California, Estados Unidos </conf-loc>
<page-range>38-51</page-range></nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kenyon-Mathieu]]></surname>
<given-names><![CDATA[C]]></given-names>
</name>
<name>
<surname><![CDATA[Schudy]]></surname>
<given-names><![CDATA[W]]></given-names>
</name>
</person-group>
<source><![CDATA[How to rank with few errors]]></source>
<year></year>
<conf-name><![CDATA[ Thirty NinthAnnual ACM Symposium on Theory of Computing, STOC]]></conf-name>
<conf-loc>San Diego, CA, Estados Unidos </conf-loc>
<page-range>95-103</page-range></nlm-citation>
</ref>
<ref id="B17">
<label>17</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hillier]]></surname>
<given-names><![CDATA[FS]]></given-names>
</name>
<name>
<surname><![CDATA[Lieberman]]></surname>
<given-names><![CDATA[GJ]]></given-names>
</name>
</person-group>
<source><![CDATA[Introduction to Operations Research]]></source>
<year>2010</year>
<publisher-loc><![CDATA[Sl. ]]></publisher-loc>
<publisher-name><![CDATA[McGraw-Hill]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B18">
<label>18</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Johnsonbaugh]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<source><![CDATA[Matemáticas Discretas]]></source>
<year>2004</year>
<edition>4 ed</edition>
<publisher-loc><![CDATA[La Habana, Cuba ]]></publisher-loc>
<publisher-name><![CDATA[Editorial Félix Varela]]></publisher-name>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
