{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T04:10:27Z","timestamp":1778818227482,"version":"3.51.4"},"reference-count":14,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11971146"],"award-info":[{"award-number":["11971146"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.tcs.2026.115967","type":"journal-article","created":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T23:11:37Z","timestamp":1776294697000},"page":"115967","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["An approximation algorithm for the asymmetric profitable tour problem with submodular penalties"],"prefix":"10.1016","volume":"1076","author":[{"given":"Zhenzhen","family":"Pang","sequence":"first","affiliation":[]},{"given":"Wen","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Bo","family":"Hou","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115967_bib0001","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/BF01581256","article-title":"A note on the prize collecting traveling salesman problem","volume":"59","author":"Bienstock","year":"1993","journal-title":"Math. Prog."},{"key":"10.1016\/j.tcs.2026.115967_bib0002","first-page":"297","article-title":"On prize-collecting tours and the asymmetric travelling salesman problem","volume":"2","author":"Dell'Amico","year":"1995","journal-title":"Int. Trans. Opl. Res."},{"issue":"2","key":"10.1016\/j.tcs.2026.115967_bib0003","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1137\/S0097539793242618","article-title":"A general approximation technique for constrained forest problems","volume":"24","author":"Goemans","year":"1995","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/j.tcs.2026.115967_bib0004","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1504\/IJMOR.2012.046689","article-title":"Approximating the asymmetric profitable tour","volume":"4","author":"Nguyen","year":"2012","journal-title":"Int. J. Math. Oper. Res."},{"key":"10.1016\/j.tcs.2026.115967_bib0005","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/s10878-012-9501-z","article-title":"A primal-dual approximation algorithm for the asymmetric prize-collecting TSP","volume":"25","author":"Nguyen","year":"2013","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.tcs.2026.115967_bib0006","series-title":"Submodular Functions and Optimization","author":"Fujishige","year":"2005"},{"key":"10.1016\/j.tcs.2026.115967_bib0007","series-title":"Mathematical Programing the State of the Art","first-page":"235","article-title":"Submodular functions and convexity","author":"Lov\u00e1sz","year":"1983"},{"key":"10.1016\/j.tcs.2026.115967_bib0008","doi-asserted-by":"crossref","first-page":"2165","DOI":"10.1007\/s11590-021-01724-1","article-title":"Approximation algorithms for the multiprocessor scheduling with submodular penalties","volume":"15","author":"Liu","year":"2021","journal-title":"Optim. Lett."},{"issue":"1\u20132","key":"10.1016\/j.tcs.2026.115967_bib0009","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s00453-011-9526-1","article-title":"A primal-dual approximation algorithm for the facility location problem with submodular penalties","volume":"63","author":"Du","year":"2012","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2026.115967_bib0010","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.tcs.2016.04.005","article-title":"Approximation algorithms for submodular vertex cover problems with linear\/submodular penalties using primal-dual technique","volume":"630","author":"Xu","year":"2016","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2026.115967_bib0011","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":"1970","journal-title":"Oper. Res."},{"key":"10.1016\/j.tcs.2026.115967_bib0012","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/net.3230120103","article-title":"On the worst case performance of some algorithms for the asymmetric traveling salesman problem","volume":"12","author":"Frieze","year":"1982","journal-title":"Networks"},{"key":"10.1016\/j.tcs.2026.115967_bib0013","series-title":"Analysis of the Held-Karp heuristic for the traveling salesman problem","author":"Williamson","year":"1990"},{"key":"10.1016\/j.tcs.2026.115967_bib0014","series-title":"Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"1275","article-title":"Approximation algorithms for prize collecting forest problems with submodular penalty functions","author":"Sharma","year":"2007"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002264?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526002264?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T03:23:59Z","timestamp":1778815439000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526002264"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":14,"alternative-id":["S0304397526002264"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115967","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An approximation algorithm for the asymmetric profitable tour problem with submodular penalties","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115967","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":"115967"}}