{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T08:15:00Z","timestamp":1783757700017,"version":"3.55.0"},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003500","name":"Universita degli Studi di Padova","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003500","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.orl.2026.107484","type":"journal-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T23:43:59Z","timestamp":1781048639000},"page":"107484","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Permutation for online metric matching with m distinct servers"],"prefix":"10.1016","volume":"68","author":[{"given":"Alberto","family":"Nicoletti","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Enoch","family":"Peserico","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9108-2448","authenticated-orcid":false,"given":"Michele","family":"Scquizzato","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.orl.2026.107484_bib0001","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1006\/jagm.1993.1026","article-title":"Online weighted matching","volume":"14","author":"Kalyanasundaram","year":"1993","journal-title":"J. Algo."},{"issue":"2","key":"10.1016\/j.orl.2026.107484_bib0002","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0304-3975(94)90042-6","article-title":"On-line algorithms for weighted bipartite matching and stable marriages","volume":"127","author":"Khuller","year":"1994","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.orl.2026.107484_bib0003","series-title":"Online Computation and Competitive Analysis","author":"Borodin","year":"1998"},{"key":"10.1016\/j.orl.2026.107484_bib0004","series-title":"Online Algorithms: The State of the Art","first-page":"268","article-title":"Online network optimization problems","author":"Kalyanasundaram","year":"1998"},{"key":"10.1016\/j.orl.2026.107484_bib0005","series-title":"Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming (ICALP)","first-page":"94:1","article-title":"A nearly optimal deterministic algorithm for online transportation problem","author":"Harada","year":"2025"},{"key":"10.1016\/j.orl.2026.107484_bib0006","series-title":"Proceedings of the 2026 SIAM Symposium on Simplicity in Algorithms (SOSA)","first-page":"463","article-title":"Competitive online transportation simplified","author":"Arndt","year":"2026"},{"key":"10.1016\/j.orl.2026.107484_bib0007","series-title":"Proceedings of the 34th International Symposium on Computational Geometry (SoCG)","first-page":"67:1","article-title":"Optimal analysis of an online algorithm for the bipartite matching problem on a line","author":"Raghvendra","year":"2018"},{"issue":"3","key":"10.1016\/j.orl.2026.107484_bib0008","first-page":"28:1","article-title":"Matching on the line admits no o(logn)-competitive algorithm","volume":"19","author":"Peserico","year":"2023","journal-title":"ACM Trans. Algo."},{"key":"10.1016\/j.orl.2026.107484_bib0009","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/j.tcs.2019.08.011","article-title":"Online facility assignment","volume":"806","author":"Ahmed","year":"2020","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"10.1016\/j.orl.2026.107484_bib0010","first-page":"2150156:1","article-title":"Competitive analysis for two variants of online metric matching problem","volume":"13","author":"Itoh","year":"2021","journal-title":"Discret. Math. Algo. Appl."},{"issue":"5","key":"10.1016\/j.orl.2026.107484_bib0011","first-page":"2350057:1","article-title":"Capacity-insensitive algorithms for online facility assignment problems on a line","volume":"16","author":"Harada","year":"2024","journal-title":"Discret. Math. Algo. Appl."},{"key":"10.1016\/j.orl.2026.107484_bib0012","unstructured":"T. Harada, A Lower Bound on the Competitive Ratio of the Permutation Algorithm for Online Facility Assignment on a Line, 2024. arXiv: 2402.12734 [cs.DS]."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637726000817?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637726000817?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T08:09:10Z","timestamp":1783757350000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637726000817"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":12,"alternative-id":["S0167637726000817"],"URL":"https:\/\/doi.org\/10.1016\/j.orl.2026.107484","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Permutation for online metric matching with m distinct servers","name":"articletitle","label":"Article Title"},{"value":"Operations Research Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.orl.2026.107484","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"107484"}}