{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T22:49:00Z","timestamp":1774910940978,"version":"3.50.1"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032205360","type":"print"},{"value":"9783032205377","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-20537-7_2","type":"book-chapter","created":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T14:28:46Z","timestamp":1773757726000},"page":"18-34","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Heuristic Methods for\u00a0Top-k List Aggregation Under the\u00a0Generalized Kendall Tau Distance"],"prefix":"10.1007","author":[{"given":"Sina","family":"Akbari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abeer","family":"Abdelhadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adolfo R.","family":"Escobedo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,3,18]]},"reference":[{"issue":"2","key":"2_CR1","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/s00453-008-9211-1","volume":"57","author":"N Ailon","year":"2010","unstructured":"Ailon, N.: Aggregation of partial rankings, p-ratings and top-m lists. Algorithmica 57(2), 284\u2013300 (2010)","journal-title":"Algorithmica"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Akbari, S., Escobedo, A.R.: Top-k list aggregation: mathematical formulations and polyhedral comparisons. In: International Symposium on Combinatorial Optimization, pp. 51\u201363. Springer, Cham (2022)","DOI":"10.1007\/978-3-031-18530-4_4"},{"key":"2_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2023.106164","volume":"153","author":"S Akbari","year":"2023","unstructured":"Akbari, S., Escobedo, A.R.: Approximate condorcet partitioning: solving large-scale rank aggregation problems. Comput. Oper. Res. 153, 106164 (2023)","journal-title":"Comput. Oper. Res."},{"key":"2_CR4","unstructured":"Aslay, C., Barbieri, N., Bonchi, F., Baeza-Yates, R.: Online topic-aware influence maximization queries. In: EDBT, pp. 295\u2013306 (2014)"},{"issue":"10","key":"2_CR5","doi-asserted-by":"publisher","first-page":"1448","DOI":"10.1016\/j.comnet.2005.10.020","volume":"50","author":"J Bar-Ilan","year":"2006","unstructured":"Bar-Ilan, J., Mat-Hassan, M., Levene, M.: Methods for comparing rankings of search engine results. Comput. Netw. 50(10), 1448\u20131463 (2006)","journal-title":"Comput. Netw."},{"key":"2_CR6","unstructured":"Borda, J.C.d.: M\u00e9moire sur les \u00e9lections au scrutin: Histoire de l\u2019acad\u00e9mie royale des sciences. Paris, France 12 (1781)"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D.: Handbook of Computational Social Choice. Cambridge University Press (2016)","DOI":"10.1017\/CBO9781107446984.002"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Cao, Z., Qin, T., Liu, T.Y., Tsai, M.F., Li, H.: Learning to rank: from pairwise approach to listwise approach. In: Proceedings of the 24th International Conference on Machine Learning, pp. 129\u2013136 (2007)","DOI":"10.1145\/1273496.1273513"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Collier, J.H., Konagurthu, A.S.: An information measure for comparing top k lists. In: 2014 IEEE 10th International Conference on e-Science, vol. 1, pp. 127\u2013134. IEEE (2014)","DOI":"10.1109\/eScience.2014.39"},{"issue":"2","key":"2_CR10","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/j.ejor.2005.03.048","volume":"172","author":"WD Cook","year":"2006","unstructured":"Cook, W.D.: Distance-based and ad hoc consensus models in ordinal preference ranking. Eur. J. Oper. Res. 172(2), 369\u2013385 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"2_CR11","unstructured":"Critchlow, D.E.: Metric Methods for Analyzing Partially Ranked Data, vol. 34. Springer, Cham (2012)"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"DeConde, R.P., Hawley, S., Falcon, S., Clegg, N., Knudsen, B., Etzioni, R.: Combining results of microarray experiments: a rank aggregation approach. Stat. Appl. Genet. Molecular Biol. 5(1) (2006)","DOI":"10.2202\/1544-6115.1204"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Diaconis, P.: Group representations in probability and statistics. Lecture Notes-Monograph Series 11, i\u2013192 (1988)","DOI":"10.1214\/lnms\/1215467407"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: Proceedings of the 10th International Conference on World Wide Web, pp. 613\u2013622 (2001)","DOI":"10.1145\/371920.372165"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.cor.2017.01.017","volume":"82","author":"A D\u2019Ambrosio","year":"2017","unstructured":"D\u2019Ambrosio, A., Mazzeo, G., Iorio, C., Siciliano, R.: A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach. Comput. Oper. Res. 82, 126\u2013138 (2017)","journal-title":"Comput. Oper. Res."},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Fagin, R., Kumar, R., Mahdian, M., Sivakumar, D., Vee, E.: Comparing and aggregating rankings with ties. In: Proceedings of the Twenty-Third ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 47\u201358 (2004)","DOI":"10.1145\/1055558.1055568"},{"issue":"1","key":"2_CR17","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1137\/S0895480102412856","volume":"17","author":"R Fagin","year":"2003","unstructured":"Fagin, R., Kumar, R., Sivakumar, D.: Comparing top k lists. SIAM J. Discret. Math. 17(1), 134\u2013160 (2003)","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"2_CR18","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/opre.22.1.180","volume":"22","author":"F Glover","year":"1974","unstructured":"Glover, F., Woolsey, E.: Converting the 0\u20131 polynomial programming problem to a 0\u20131 linear program. Oper. Res. 22(1), 180\u2013182 (1974)","journal-title":"Oper. Res."},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Goodman, L.A., Kruskal, W.H.: Measures of association for cross classifications. II: Further discussion and references. J. Am. Stat. Assoc. 54(285), 123\u2013163 (1959)","DOI":"10.1080\/01621459.1959.10501503"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Kemmer, R., Yoo, Y., Escobedo, A., Maciejewski, R.: Enhancing collective estimates by aggregating cardinal and ordinal inputs. In: Proceedings of the AAAI Conference on Human Computation and Crowdsourcing, vol. 8, pp. 73\u201382 (2020)","DOI":"10.1609\/hcomp.v8i1.7465"},{"issue":"1\u20132","key":"2_CR21","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Nav. Res. Logist. Q. 2(1\u20132), 83\u201397 (1955)","journal-title":"Nav. Res. Logist. Q."},{"key":"2_CR22","volume-title":"Individual Choice Behavior","author":"RD Luce","year":"1959","unstructured":"Luce, R.D., et al.: Individual Choice Behavior, vol. 4. Wiley, New York (1959)"},{"issue":"1\/2","key":"2_CR23","doi-asserted-by":"publisher","first-page":"114","DOI":"10.2307\/2333244","volume":"44","author":"CL Mallows","year":"1957","unstructured":"Mallows, C.L.: Non-null ranking models. I. Biometrika 44(1\/2), 114\u2013130 (1957)","journal-title":"Biometrika"},{"issue":"8","key":"2_CR24","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1038\/nmeth.2016","volume":"9","author":"D Marbach","year":"2012","unstructured":"Marbach, D., et al.: Wisdom of crowds for robust gene network inference. Nat. Methods 9(8), 796\u2013804 (2012)","journal-title":"Nat. Methods"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Mathieu, C., Mauras, S.: How to aggregate top-lists: approximation algorithms via scores and average ranks. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2810\u20132822. SIAM (2020)","DOI":"10.1137\/1.9781611975994.171"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Mattei, N., Walsh, T.: Preflib: a library for preferences. In: International Conference on Algorithmic Decision Theory, pp. 259\u2013270. Springer, Cham (2013). http:\/\/www.preflib.org","DOI":"10.1007\/978-3-642-41575-3_20"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"McCown, F., Nelson, M.L.: Agreeing to disagree: search engines and their public interfaces. In: Proceedings of the 7th ACM\/IEEE-CS Joint Conference on Digital Libraries, pp. 309\u2013318 (2007)","DOI":"10.1145\/1255175.1255237"},{"key":"2_CR28","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.neucom.2016.07.073","volume":"250","author":"G N\u00e1poles","year":"2017","unstructured":"N\u00e1poles, G., Falcon, R., Dikopoulou, Z., Papageorgiou, E., Bello, R., Vanhoof, K.: Weighted aggregation of partial rankings using ant colony optimization. Neurocomputing 250, 109\u2013120 (2017)","journal-title":"Neurocomputing"},{"issue":"2","key":"2_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3365375","volume":"11","author":"SE Oliveira","year":"2020","unstructured":"Oliveira, S.E., Diniz, V., Lacerda, A., Merschmanm, L., Pappa, G.L.: Is rank aggregation effective in recommender systems? An experimental analysis. ACM Trans. Intell. Syst. Technol. (TIST) 11(2), 1\u201326 (2020)","journal-title":"ACM Trans. Intell. Syst. Technol. (TIST)"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Oosterhuis, H., de Rijke, M.: Policy-aware unbiased learning to rank for top-k rankings. In: Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 489\u2013498 (2020)","DOI":"10.1145\/3397271.3401102"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Pal, K., Michel, S.: Efficient similarity search across top-k lists under the Kendall\u2019s tau distance. In: Proceedings of the 28th International Conference on Scientific and Statistical Database Management, pp. 1\u201312 (2016)","DOI":"10.1145\/2949689.2949709"},{"issue":"4","key":"2_CR32","first-page":"384","volume":"21","author":"LL Thurstone","year":"1927","unstructured":"Thurstone, L.L.: The method of paired comparisons for social values. Psychol. Sci. Public Interest 21(4), 384 (1927)","journal-title":"Psychol. Sci. Public Interest"},{"issue":"6","key":"2_CR33","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1016\/j.is.2013.01.002","volume":"38","author":"R Varadarajan","year":"2013","unstructured":"Varadarajan, R., Farf\u00e1n, F., Hristidis, V.: Comparing top-k xml lists. Inf. Syst. 38(6), 820\u2013834 (2013)","journal-title":"Inf. Syst."},{"issue":"4","key":"2_CR34","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1287\/deca.2021.0433","volume":"18","author":"Y Yoo","year":"2021","unstructured":"Yoo, Y., Escobedo, A.R.: A new binary programming formulation and social choice property for Kemeny rank aggregation. Decis. Anal. 18(4), 296\u2013320 (2021)","journal-title":"Decis. Anal."}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-20537-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T22:02:27Z","timestamp":1774908147000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-20537-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032205360","9783032205377"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-20537-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"18 March 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoCOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2026\/evocop\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}