{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:32:48Z","timestamp":1761611568072,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319788241"},{"type":"electronic","value":"9783319788258"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-78825-8_25","type":"book-chapter","created":{"date-parts":[[2018,4,16]],"date-time":"2018-04-16T18:59:07Z","timestamp":1523905147000},"page":"299-311","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Heuristic, Branch-and-Bound Solver and Improved Space Reduction for the Median of Permutations Problem"],"prefix":"10.1007","author":[{"given":"Robin","family":"Milosz","sequence":"first","affiliation":[]},{"given":"Sylvie","family":"Hamel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,17]]},"reference":[{"issue":"5","key":"25_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1411509.1411513","volume":"55","author":"N Ailon","year":"2008","unstructured":"Ailon, N., Charikar, M., Newman, N.: Aggregating inconsistent information: ranking and clustering. J. ACM 55(5), 1\u201327 (2008)","journal-title":"J. ACM"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1007\/s10458-013-9236-y","volume":"28","author":"N Betzler","year":"2014","unstructured":"Betzler, N., Bredereck, R., Niedermeier, R.: Theoretical and empirical evaluation of data reduction for exact Kemeny Rank Aggregation. Auton. Agent. Multi-Agent Syst. 28, 721\u2013748 (2014)","journal-title":"Auton. Agent. Multi-Agent Syst."},{"issue":"4","key":"25_CR3","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1016\/j.jcss.2010.07.005","volume":"77","author":"N Betzler","year":"2011","unstructured":"Betzler, N., et al.: Average parameterization and partial kernelization for computing medians. J. Comput. Syst. Sci. 77(4), 774\u2013789 (2011)","journal-title":"J. Comput. Syst. Sci."},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11618058_1","volume-title":"Graph Drawing","author":"T Biedl","year":"2006","unstructured":"Biedl, T., Brandenburg, F.J., Deng, X.: Crossings and permutations. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 1\u201312. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11618058_1"},{"issue":"2","key":"25_CR5","first-page":"161","volume":"21","author":"G Blin","year":"2011","unstructured":"Blin, G., Crochemore, M., Hamel, S., Vialette, S.: Median of an odd number of permutations. Pure Math. Appl. 21(2), 161\u2013175 (2011)","journal-title":"Pure Math. Appl."},{"key":"25_CR6","unstructured":"Conitzer, V., Davenport, A., Kalagnanam, J.: Improved bounds for computing Kemeny rankings. In: Proceedings of the 21st Conference on Artificial Intelligence, AAAI 2006, vol. 1, pp. 620\u2013626 (2006)"},{"key":"25_CR7","unstructured":"Davenport, A., Kalagnanam, J.: A computational study of the Kemeny rule for preference aggregation. In: Proceedings of the 19th National Conference on Artificial Intelligence, AAAI 2004, pp. 697\u2013702 (2004)"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: Proceedings of the 10th WWW, pp. 613\u2013622 (2001)","DOI":"10.1145\/371920.372165"},{"key":"25_CR9","unstructured":"Fisher, R.A., Yates, F.: Statistical Tables for Biological, Agricultural and Medical Research, 3rd edn, pp. 26\u201327. Oliver & Boyd, London (1948)"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Springer, Boston (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-642-17517-6_3","volume-title":"Algorithms and Computation","author":"M Karpinski","year":"2010","unstructured":"Karpinski, M., Schudy, W.: Faster algorithms for feedback arc set tournament, kemeny rank aggregation and betweenness tournament. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol. 6506, pp. 3\u201314. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17517-6_3"},{"key":"25_CR12","first-page":"577","volume":"88","author":"J Kemeny","year":"1959","unstructured":"Kemeny, J.: Mathematics without numbers. Daedalus 88, 577\u2013591 (1959)","journal-title":"Daedalus"},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1093\/biomet\/30.1-2.81","volume":"30","author":"M Kendall","year":"1938","unstructured":"Kendall, M.: A new measure of rank correlation. Biometrika 30, 81\u201389 (1938)","journal-title":"Biometrika"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Kenyon-Mathieu, C., Schudy, W.: How to rank with few errors. In: STOC 2007, pp. 95\u2013103 (2007)","DOI":"10.1145\/1250790.1250806"},{"issue":"4598","key":"25_CR15","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21\u20136","author":"N Metropolis","year":"1953","unstructured":"Metropolis, N., Rosenbluth, A.W., Rosenbluth, M.N., Marshall, N., Teller, A.H., Teller, E.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21\u20136, 1087\u20131092 (1953)","journal-title":"J. Chem. Phys."},{"issue":"1","key":"25_CR17","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.mathsocsci.2011.08.008","volume":"64","author":"Alnur 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":"Mathematical Social Sciences"},{"key":"25_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-319-29221-2_23","volume-title":"Algorithms and Discrete Applied Mathematics","author":"R Milosz","year":"2016","unstructured":"Milosz, R., Hamel, S.: Medians of permutations: building constraints. In: Govindarajan, S., Maheshwari, A. (eds.) CALDAM 2016. LNCS, vol. 9602, pp. 264\u2013276. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29221-2_23"},{"key":"25_CR19","unstructured":"Milosz, R., Hamel, S.: Space reduction constraints for the median of permutations problem. J. Discret. Appl. Math. (submitted)"},{"key":"25_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/978-3-642-40104-6_44","volume-title":"Algorithms and Data Structures","author":"N Nishimura","year":"2013","unstructured":"Nishimura, N., Simjour, N.: Parameterized enumeration of (locally-) optimal aggregations. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 512\u2013523. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40104-6_44"},{"issue":"3","key":"25_CR21","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1287\/moor.1090.0385","volume":"34","author":"A van Zuylen","year":"2009","unstructured":"van Zuylen, A., Williamson, D.P.: Deterministic pivoting algorithms for constrained ranking and clustering problems. Math. Oper. Res. 34(3), 594\u2013620 (2009)","journal-title":"Math. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-78825-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:09:08Z","timestamp":1709809748000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-78825-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319788241","9783319788258"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-78825-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"17 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Newcastle","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/carma.newcastle.edu.au\/meetings\/iwoca\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}