{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T12:47:55Z","timestamp":1769345275561,"version":"3.49.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,2,26]],"date-time":"2024-02-26T00:00:00Z","timestamp":1708905600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,26]],"date-time":"2024-02-26T00:00:00Z","timestamp":1708905600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","award":["UI\/297\/2020"],"award-info":[{"award-number":["UI\/297\/2020"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s10878-024-01109-x","type":"journal-article","created":{"date-parts":[[2024,2,26]],"date-time":"2024-02-26T03:01:52Z","timestamp":1708916512000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A linear ordering problem with weighted rank"],"prefix":"10.1007","volume":"47","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2826-7220","authenticated-orcid":false,"given":"Manuel V. C.","family":"Vieira","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,26]]},"reference":[{"key":"1109_CR1","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1007\/s11750-020-00552-3","volume":"28","author":"J Alcaraz","year":"2020","unstructured":"Alcaraz J, Garc\u00eda-Nov\u00e9 EM, Landete M, Mongel JF (2020) The linear ordering problem with clusters: a new partial ranking. TOP 28:646\u2013671","journal-title":"TOP"},{"key":"1109_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/s11081-021-09650-y","author":"PE Anderson","year":"2021","unstructured":"Anderson PE, Chartier TP, Langville AN, Pedings-Behling KE (2021) Fairness and the set of optimal rankings for the linear ordering problem. Optim Eng. https:\/\/doi.org\/10.1007\/s11081-021-09650-y","journal-title":"Optim Eng"},{"key":"1109_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-70990-7","volume-title":"Facility layout: mathematical optimization techniques and engineering applications","author":"MF Anjos","year":"2021","unstructured":"Anjos MF, Vieira MVC (2021) Facility layout: mathematical optimization techniques and engineering applications. Springer, Berlin"},{"key":"1109_CR4","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s10479-019-03473-y","volume":"288","author":"J Aparicio","year":"2020","unstructured":"Aparicio J, Landete M, Monge JF (2020) A linear ordering problem of sets. Ann Oper Res 288:45\u201364","journal-title":"Ann Oper Res"},{"issue":"3","key":"1109_CR5","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1016\/j.ejor.2014.09.041","volume":"241","author":"J Ceberio","year":"2015","unstructured":"Ceberio J, Mendiburu A, Lozano JA (2015) The linear ordering problem revisited. Eur J Oper Res 241(3):686\u2013696","journal-title":"Eur J Oper Res"},{"key":"1109_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.105998","volume":"87","author":"J Ceberio","year":"2020","unstructured":"Ceberio J, Santucci V (2020) Using pairwise precedences for solving the linear ordering problem. Appl Soft Comput 87:105998","journal-title":"Appl Soft Comput"},{"key":"1109_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10288-007-0036-6","volume":"5","author":"I Charon","year":"2007","unstructured":"Charon I, Hudry I (2007) A survey on the linear orderign problem for weighted or unweighted tournaments. 4OR 5:5\u201360","journal-title":"4OR"},{"key":"1109_CR8","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10479-009-0648-7","volume":"175","author":"I Charon","year":"2010","unstructured":"Charon I, Hudry I (2010) An updated survey on the linear orderign problem for weighted or unweighted tournaments. Ann Oper Res 175:107\u2013158","journal-title":"Ann Oper Res"},{"issue":"2","key":"1109_CR9","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.ejor.2011.07.036","volume":"216","author":"A Duarte","year":"2012","unstructured":"Duarte A, Mart\u00ed R, \u00c1lvarez A, \u00c1ngel-Bello F (2012) Metaheuristics for the linear ordering problem with cumulative costs. Eur J Oper Res 216(2):270\u2013277","journal-title":"Eur J Oper Res"},{"key":"1109_CR10","doi-asserted-by":"crossref","unstructured":"Graham-Squire A and Zayatz N (2020) Lack of monotonicity anomalies in empirical data of instant-runoff elections. Representation","DOI":"10.1080\/00344893.2020.1785536"},{"issue":"6","key":"1109_CR11","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.1287\/opre.32.6.1195","volume":"32","author":"M Gr\u00f6tschel","year":"1984","unstructured":"Gr\u00f6tschel M, J\u00fcnger M, Reinelt G (1984) A cutting plane algorithm for the linear ordering problem. Oper Res 32(6):1195\u20131220","journal-title":"Oper Res"},{"key":"1109_CR12","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF01582010","volume":"33","author":"M Gr\u00f6tschel","year":"1985","unstructured":"Gr\u00f6tschel M, J\u00fcnger M, Reinelt G (1985) Facets of the linear ordering polytope. Math Program 33:43\u201360","journal-title":"Math Program"},{"key":"1109_CR13","doi-asserted-by":"crossref","unstructured":"Hautz J, Hungerl\u00e4nder P, Lechner T, Maier K, Rescher P (2020) The weighted linear ordering problem. In: Neufeld JS, Buscher U, Lasch R, M\u00f6st D, Sch\u00f6nberger J (eds) Operations research proceedings 2019. Operations research proceedings (GOR (Gesellschaft f\u00fcr Operations Research e.V.)). Springer, Cham","DOI":"10.1007\/978-3-030-48439-2_27"},{"key":"1109_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-012-9505-8","volume":"55","author":"P Hungerl\u00e4nder","year":"2013","unstructured":"Hungerl\u00e4nder P, Rendl F (2013) A computational study and survey of methods for the single-row facility layout problem. Comput Optim Appl 55:1\u201320","journal-title":"Comput Optim Appl"},{"key":"1109_CR15","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10107-012-0627-7","volume":"140","author":"P Hungerl\u00e4nder","year":"2013","unstructured":"Hungerl\u00e4nder P, Rendl F (2013) Semidefinite relaxations of ordering problems. Math Program 140:77\u201397","journal-title":"Math Program"},{"key":"1109_CR16","doi-asserted-by":"publisher","first-page":"1703","DOI":"10.1007\/s11590-014-0824-9","volume":"9","author":"P Hungerl\u00e4nder","year":"2015","unstructured":"Hungerl\u00e4nder P (2015) A semidefinite optimization approach to the Target Visitation Problem. Optim Lett 9:1703\u20131727","journal-title":"Optim Lett"},{"issue":"4","key":"1109_CR17","first-page":"577","volume":"88","author":"JG Kemeney","year":"1959","unstructured":"Kemeney JG (1959) Mathematics without numbers. Daedelus 88(4):577\u2013591","journal-title":"Daedelus"},{"issue":"12","key":"1109_CR18","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1016\/S0305-0548(98)00104-X","volume":"26","author":"M Laguna","year":"1999","unstructured":"Laguna M, Mart\u00ed R, Campos V (1999) Intensification and diversification with elite Tabu search solutions for the linear ordering problem. Comput Oper Res 26(12):1217\u20131230","journal-title":"Comput Oper Res"},{"key":"1109_CR19","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s12293-022-00378-5","volume":"14","author":"L Lugo","year":"2022","unstructured":"Lugo L, Segura C, Miranda G (2022) A diversity-awarememetic algorithm for the linear ordering problem. Memetic Comput 14:395\u2013409","journal-title":"Memetic Comput"},{"key":"1109_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16729-4","volume-title":"The linear ordering problem: exact and heuristic methods in combinatorial optimization","author":"R Mart\u00ed","year":"2011","unstructured":"Mart\u00ed R, Reinelt G (2011) The linear ordering problem: exact and heuristic methods in combinatorial optimization. Springer, Berlin"},{"key":"1109_CR21","doi-asserted-by":"publisher","first-page":"1297","DOI":"10.1007\/s10589-010-9384-9","volume":"51","author":"R Mart\u00ed","year":"2012","unstructured":"Mart\u00ed R, Reinelt G, Duarte A (2012) A benchmark library and a comparison of heuristic methods for the linear ordering problem. Comput Optim Appl 51:1297\u20131317","journal-title":"Comput Optim Appl"},{"key":"1109_CR22","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.dam.2019.08.010","volume":"271","author":"I M\u00e9ndez-D\u00edaz","year":"2019","unstructured":"M\u00e9ndez-D\u00edaz I, Vulcano G, Zabala P (2019) Analysis of a generalized Linear Ordering Problem via integer programming. Discret Appl Math 271:93\u2013107","journal-title":"Discret Appl Math"},{"key":"1109_CR23","series-title":"International series in operations research & management science","doi-asserted-by":"publisher","DOI":"10.1007\/0-306-48056-5_5","volume-title":"Handbook of metaheuristics","author":"P Moscato","year":"2003","unstructured":"Moscato P, Cotta C (2003) A gentle introduction to memetic algorithms. In: Glover F, Kochenberger GA (eds) Handbook of metaheuristics, vol 57. International series in operations research & management science. Springer, Boston"},{"key":"1109_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.104861","volume":"115","author":"Y Qian","year":"2020","unstructured":"Qian Y, Lin J, Li D, Hu H (2020) Block-insertion-based algorithms for the linear ordering problem. Comput Oper Res 115:104861","journal-title":"Comput Oper Res"},{"key":"1109_CR25","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10852-005-2583-1","volume":"3","author":"T Schiavinotto","year":"2005","unstructured":"Schiavinotto T, St\u00fctzle T (2005) The linear ordering problem: instances, search space analysis and algorithms. J Math Model Algor 3:367\u2013402","journal-title":"J Math Model Algor"},{"issue":"11","key":"1109_CR26","first-page":"1793","volume":"66","author":"BE Tenner","year":"2019","unstructured":"Tenner BE, Warrington GS (2019) Accumulation charts for instant-runoff elections. Not Am Math Soc 66(11):1793\u20131799","journal-title":"Not Am Math Soc"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01109-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01109-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01109-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T23:14:18Z","timestamp":1710285258000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01109-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,26]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["1109"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01109-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,26]]},"assertion":[{"value":"17 January 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author declare that he has no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"13"}}