{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,28]],"date-time":"2026-08-28T14:20:40Z","timestamp":1787926840458,"version":"build-2784847793"},"reference-count":18,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2027,7,21]],"date-time":"2027-07-21T00:00:00Z","timestamp":1816128000000},"content-version":"am","delay-in-days":262,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2442250"],"award-info":[{"award-number":["CCF-2442250"]}],"id":[{"id":"10.13039\/100000001","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,11]]},"DOI":"10.1016\/j.orl.2026.107493","type":"journal-article","created":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T06:48:07Z","timestamp":1784270887000},"page":"107493","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Maximum entropy is a 10\/7-approximation algorithm for the TSP on half-integral cycle cut instances"],"prefix":"10.1016","volume":"69","author":[{"given":"Billy","family":"Jin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-4052-5864","authenticated-orcid":false,"given":"Nathan","family":"Klein","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David P.","family":"Williamson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.orl.2026.107493_bib0001","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BFb0120913","article-title":"Heuristic analysis, linear programming and branch and bound","volume":"13","author":"Wolsey","year":"1980","journal-title":"Math. Program. Study"},{"key":"10.1016\/j.orl.2026.107493_bib0002","series-title":"2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)","first-page":"832","article-title":"A (slightly) improved bound on the integrality gap of the subtour LP for TSP","author":"Karlin","year":"2022"},{"key":"10.1016\/j.orl.2026.107493_bib0003","series-title":"Integer Programming and Combinatorial Optimization","first-page":"217","article-title":"A 4\/3-approximation algorithm for half-integral cycle cut instances of the TSP","author":"Jin","year":"2023"},{"key":"10.1016\/j.orl.2026.107493_bib0004","series-title":"Technical Report","article-title":"Worst Case Analysis of A New Heuristic for the Traveling Salesman Problem","author":"Christofides","year":"1976"},{"key":"10.1016\/j.orl.2026.107493_bib0005","first-page":"76","article-title":"On some extremal walks in graphs","volume":"17","author":"Serdyukov","year":"1978","journal-title":"Upr. Sist."},{"issue":"4","key":"10.1016\/j.orl.2026.107493_bib0006","first-page":"393","article-title":"Solution of a large-scale traveling-salesman problem","volume":"2","author":"Dantzig","year":"1954","journal-title":"J. Oper. Res. Soc. Am."},{"key":"10.1016\/j.orl.2026.107493_bib0007","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","article-title":"The traveling-salesman problem and minimum spanning trees","volume":"18","author":"Held","year":"1971","journal-title":"Oper. Res."},{"key":"10.1016\/j.orl.2026.107493_bib0008","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1287\/opre.2017.1603","article-title":"An O(log\u2009n\/log\u2009log\u2009n)-approximation algorithm for the asymmetric traveling salesman problem","volume":"65","author":"Asadpour","year":"2017","journal-title":"Oper. Res."},{"key":"10.1016\/j.orl.2026.107493_bib0009","series-title":"Proceedings of the 52nd Annual IEEE Symposium on the Foundations of Computer Science","first-page":"550","article-title":"A randomized rounding approach to the traveling salesman problem","author":"Gharan","year":"2011"},{"issue":"6","key":"10.1016\/j.orl.2026.107493_bib0010","doi-asserted-by":"crossref","first-page":"2543","DOI":"10.1287\/opre.2022.2338","article-title":"A (slightly) improved approximation algorithm for metric tsp","volume":"72","author":"Karlin","year":"2024","journal-title":"Oper. Res."},{"key":"10.1016\/j.orl.2026.107493_bib0011","series-title":"51st International Colloquium on Automata, Languages, and Programming (ICALP)","first-page":"1","article-title":"From trees to polynomials and back again: new capacity bounds with applications to TSP","volume":"vol. 297","author":"Gurvits","year":"2024"},{"issue":"2","key":"10.1016\/j.orl.2026.107493_bib0012","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1287\/moor.2013.0608","article-title":"2-matchings, the traveling salesman problem, and the subtour LP: a proof of the Boyd-Carr conjecture","volume":"39","author":"Schalekamp","year":"2014","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.orl.2026.107493_bib0013","series-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2025)","first-page":"1","article-title":"Dual charging for half-Integral TSP","volume":"vol. 353","author":"Klein","year":"2025"},{"issue":"1","key":"10.1016\/j.orl.2026.107493_bib0014","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1007\/s10107-024-02065-4","article-title":"Matroid-based TSP rounding for half-integral solutions","volume":"206","author":"Gupta","year":"2024","journal-title":"Math. Program."},{"key":"10.1016\/j.orl.2026.107493_bib0015","series-title":"Leibniz International Proceedings in Informatics (LIPIcs)","first-page":"1","article-title":"Towards improving Christofides algorithm for half-Integer TSP","volume":"vol. 144","author":"Haddadan","year":"2019"},{"key":"10.1016\/j.orl.2026.107493_bib0016","series-title":"Proceedings of the 52nd Annual ACM Symposium on the Theory of Computing","first-page":"28","article-title":"An improved approximation algorithm for TSP in the half integral case","author":"Karlin","year":"2020"},{"key":"10.1016\/j.orl.2026.107493_bib0017","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/s10107-025-02193-5","article-title":"A 4\/3-approximation algorithm for half-integral cycle cut instances of the TSP","volume":"210","author":"Jin","year":"2025","journal-title":"Math. Program. B"},{"key":"10.1016\/j.orl.2026.107493_bib0018","unstructured":"B. Jin, N. Klein, D.P. Williamson, A lower bound for the maximum entropy algorithm for TSP, Math. Program. B2025. To appear. See also, https:\/\/arxiv.org\/abs\/2311.01950."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637726000908?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637726000908?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,8,28]],"date-time":"2026-08-28T13:22:30Z","timestamp":1787923350000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637726000908"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":18,"alternative-id":["S0167637726000908"],"URL":"https:\/\/doi.org\/10.1016\/j.orl.2026.107493","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Maximum entropy is a 10\/7-approximation algorithm for the TSP on half-integral cycle cut instances","name":"articletitle","label":"Article Title"},{"value":"Operations Research Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.orl.2026.107493","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":"107493"}}