{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T14:31:24Z","timestamp":1774449084142,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,6,10]],"date-time":"2016-06-10T00:00:00Z","timestamp":1465516800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s11590-016-1047-z","type":"journal-article","created":{"date-parts":[[2016,6,10]],"date-time":"2016-06-10T08:59:55Z","timestamp":1465549195000},"page":"667-678","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Rank aggregation in cyclic sequences"],"prefix":"10.1007","volume":"11","author":[{"given":"Eva M.","family":"Garc\u00eda-Nov\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Javier","family":"Alcaraz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mercedes","family":"Landete","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan F.","family":"Monge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Justo","family":"Puerto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,10]]},"reference":[{"key":"1047_CR1","doi-asserted-by":"crossref","unstructured":"Aledo, J.A., G\u00e0mez, J.A., Molina, D.: Tackling the rank aggregation problem with evolutionay algorithms. Appl. Math. Comput. 222, 632\u2013644 (2013)","DOI":"10.1016\/j.amc.2013.07.081"},{"key":"1047_CR2","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.mathsocsci.2011.08.008","volume":"64","author":"A Ali","year":"2012","unstructured":"Ali, A., Meil\u0103, M.: Experiments with Kemeny ranking: what works when? Math. Soc. Sci. 64, 28\u201340 (2012)","journal-title":"Math. Soc. Sci."},{"key":"1047_CR3","doi-asserted-by":"crossref","unstructured":"Andoni, A., Fagin, R., Kumar, R., Patrascu, M., Sivakumar, D.: Efficient similarity search and classification via rank aggregation. In: Proceedings of the ACM SIG-MOD International Conference on Management of Data, pp. 1375\u20131376 (2008)","DOI":"10.1145\/1376616.1376778"},{"issue":"5","key":"1047_CR4","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1007\/s10458-013-9236-y","volume":"28","author":"N Betzler","year":"2014","unstructured":"Betzler, N., Brederec, R., Niedermeier, R.: Theoretical and empirical evaluation of data reduction for exact Kemeny rank aggregation. Auton. Agents Multi Agent Syst. 28(5), 721\u2013748 (2014)","journal-title":"Auton. Agents Multi Agent Syst."},{"key":"1047_CR5","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1007\/s11590-013-0625-6","volume":"8","author":"GG Bolotashvili","year":"2014","unstructured":"Bolotashvili, G.G., Demidenko, V.M., Pisaruk, N.N.: Fence facets from non-regular graphs for the linear ordering polytope. Optim. Lett. 8, 841\u2013848 (2014)","journal-title":"Optim. Lett."},{"key":"1047_CR6","doi-asserted-by":"crossref","unstructured":"Charon, I., Hudry, O.: A survey on the linear ordering problem for weighted or unweighted tournaments. 4OR 5, 5\u201360 (2007)","DOI":"10.1007\/s10288-007-0036-6"},{"key":"1047_CR7","unstructured":"Claiborne Price, C.: Applications of operations research models to problems in health care. University of Maryland, College Park (2009)"},{"key":"1047_CR8","unstructured":"Carrizosa, E., Guerrero, V., Romero-Morales, D.: A multi-objective approach to visualize proportions and similarities between individuals by rectangular maps. http:\/\/www.optimization-online.org (2015)"},{"key":"1047_CR9","unstructured":"Conitzer, V., Davenport, A., Kalagnanam, J.: Improved bounds for computing Kemeny rankings. In: Proceedings of the 21st National Conference on Artificial intelligence, pp. 620\u2013626 (2006)"},{"key":"1047_CR10","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: Proceedings of the Tenth International World Wide Web Conference (WWW\u201901), pp. 613\u2013622 (2001)","DOI":"10.1145\/371920.372165"},{"key":"1047_CR11","doi-asserted-by":"crossref","unstructured":"Fagin, R., Kumar, R., Sivakumar, D.: Eficient similarity search and classification via rank aggregation. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 301\u2013312 (2003)","DOI":"10.1145\/872757.872795"},{"key":"1047_CR12","unstructured":"Gattaca, Lv.: An analysis of rank aggregation algorithms. In: Data Structures and Algorithms. arXiv:1402.5259v5 (2014)"},{"key":"1047_CR13","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01582010","volume":"33","author":"M Grotschel","year":"1985","unstructured":"Grotschel, M., Junger, M., Reinelt, G.: Facets of the linear ordering polytope. Math. Program. 33, 43\u201360 (1985)","journal-title":"Math. Program."},{"key":"1047_CR14","doi-asserted-by":"crossref","unstructured":"Grundel, D.A., Jeffcoat, D.E.: Formulation and solution of the target visitation problem. In: Proceedings of the AIAA 1st Intelligent Systems Technical Conferences (2004)","DOI":"10.2514\/6.2004-6212"},{"key":"1047_CR15","unstructured":"Hildenbrandt, A.: The Target Visitation Problem. PhD thesis. http:\/\/www.ub.uni-heidelberg.de\/archiv\/17993 (2015)"},{"issue":"2","key":"1047_CR16","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0166-218X(92)00151-B","volume":"50","author":"J Leung","year":"1994","unstructured":"Leung, J., Lee, J.: More facets from fences for linear ordering and acyclic subgraph polytopes. Discrete Appl. Math. 50(2), 185\u2013200 (1994)","journal-title":"Discrete Appl. Math."},{"key":"1047_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-16729-4","volume-title":"The Lineal Ordering Problem. Exact and Heuristic Methods in Combinational Optimization","author":"R Mart\u00ed","year":"2011","unstructured":"Mart\u00ed, R., Reinelt, G.: The Lineal Ordering Problem. Exact and Heuristic Methods in Combinational Optimization. Springer, New York (2011)"},{"issue":"1","key":"1047_CR18","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1007\/s11750-009-0096-1","volume":"17","author":"M Oswald","year":"2009","unstructured":"Oswald, M., Reinelt, G., Seitz, H.: Applying mod- $$k$$ k -cuts for solving linear ordering problems. Top 17(1), 158\u2013170 (2009)","journal-title":"Top"},{"key":"1047_CR19","volume-title":"The Linear Ordering Problem. Algorithms and Applications","author":"G Reinelt","year":"1985","unstructured":"Reinelt, G.: The Linear Ordering Problem. Algorithms and Applications. Heldermann, Germany (1985)"},{"issue":"4","key":"1047_CR20","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB\u2014a traveling salesman problem library. ORSA J. Comput. 3(4), 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"key":"1047_CR21","doi-asserted-by":"crossref","unstructured":"Schalekamp, F., Zuylen, A.V. : Rank aggregation: together we\u2019re strong. ALENEX 38\u201351 (2009)","DOI":"10.1137\/1.9781611972894.4"},{"key":"1047_CR22","unstructured":"Yasutake, S., Hatano, K., Takimoto, E., Takeda, M.: Online rank aggregation. In: JMLR: Workshop and Conference Proceedings. Asian Conference on Machine Learning, vol. 25, pp. 539\u2013553 (2012)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1047-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-016-1047-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1047-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1047-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T21:17:38Z","timestamp":1748985458000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-016-1047-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,10]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["1047"],"URL":"https:\/\/doi.org\/10.1007\/s11590-016-1047-z","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,10]]}}}