{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:38:30Z","timestamp":1742917110967,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031225420"},{"type":"electronic","value":"9783031225437"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-22543-7_6","type":"book-chapter","created":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T15:03:27Z","timestamp":1672671807000},"page":"81-90","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Prize-Collecting Asymmetric Traveling Salesman Problem Admits Polynomial Time Approximation Within a\u00a0Constant Ratio"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3555-0080","authenticated-orcid":false,"given":"Michael","family":"Khachay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2122-0446","authenticated-orcid":false,"given":"Katherine","family":"Neznakhina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7508-4833","authenticated-orcid":false,"given":"Ksenia","family":"Rizhenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,3]]},"reference":[{"issue":"2","key":"6_CR1","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1137\/090771429","volume":"40","author":"A Archer","year":"2011","unstructured":"Archer, A., Bateni, M., Hajiaghayi, M., Karloff, H.: Improved approximation algorithms for prize-collecting Steiner tree and tsp. SIAM J. Comput. 40(2), 309\u2013332 (2011). https:\/\/doi.org\/10.1137\/090771429","journal-title":"SIAM J. Comput."},{"issue":"6","key":"6_CR2","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1002\/net.3230190602","volume":"19","author":"E Balas","year":"1989","unstructured":"Balas, E.: The prize collecting traveling salesman problem. Networks 19(6), 621\u2013636 (1989). https:\/\/doi.org\/10.1002\/net.3230190602","journal-title":"Networks"},{"key":"6_CR3","doi-asserted-by":"publisher","unstructured":"Bateni, M., Chekuri, C., Ene, A., Hajiaghayi, M., Korula, N., Marx, D.: Prize-collecting steiner problems on planar graphs. In: Proceedings of the 2011 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1028\u20131049 (2011). https:\/\/doi.org\/10.1137\/1.9781611973082.79","DOI":"10.1137\/1.9781611973082.79"},{"issue":"1","key":"6_CR4","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1002\/net.20307","volume":"54","author":"JF B\u00e9rub\u00e9","year":"2009","unstructured":"B\u00e9rub\u00e9, J.F., Gendreau, M., Potvin, J.Y.: A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem. Networks 54(1), 56\u201367 (2009). https:\/\/doi.org\/10.1002\/net.20307","journal-title":"Networks"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/BF01581256","volume":"59","author":"D Bienstock","year":"1993","unstructured":"Bienstock, D., Goemans, M.X., Simchi-Levi, D., Williamson, D.: A note on the prize collecting traveling salesman problem. Math. Program. 59, 413\u2013420 (1993). https:\/\/doi.org\/10.1007\/BF01581256","journal-title":"Math. Program."},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Chan, T.H.H., Jiang, H., Jiang, S.H.C.: A unified PTAS for prize collecting TSP and steiner tree problem in doubling metrics. In: Azar, Y., Bast, H., Herman, G. (eds.) 26th Annual European Symposium on Algorithms (ESA 2018). Leibniz International Proceedings in Informatics (LIPIcs), vol. 112, pp. 15:1\u201315:13. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2018.15","DOI":"10.4230\/LIPIcs.ESA.2018.15"},{"key":"6_CR7","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem. In: Symposium on New Directions and Recent Results in Algorithms and Complexity, p. 441 (1975)"},{"key":"6_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105004","volume":"123","author":"SH Chung","year":"2020","unstructured":"Chung, S.H., Sah, B., Lee, J.: Optimization for drone and drone-truck combined operations: a review of the state of the art and future directions. Comput. Oper. Res. 123, 105004 (2020). https:\/\/doi.org\/10.1016\/j.cor.2020.105004","journal-title":"Comput. Oper. Res."},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"S719","DOI":"10.1051\/ro\/2020002","volume":"55","author":"G Climaco","year":"2021","unstructured":"Climaco, G., Simonetti, L., Rosetti, I.: A branch-and-cut and MIP-based heuristics for the prize-collecting travelling salesman problem. RAIRO-Oper. Res. 55, S719\u2013S726 (2021). https:\/\/doi.org\/10.1051\/ro\/2020002","journal-title":"RAIRO-Oper. Res."},{"issue":"3","key":"6_CR10","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0969-6016(95)00010-5","volume":"2","author":"M Dell\u2019Amico","year":"1995","unstructured":"Dell\u2019Amico, M., Maffioli, F., V\u00e4rbrand, P.: On prize-collecting tours and the asymmetric travelling salesman problem. Int. Trans. Oper. Res. 2(3), 297\u2013308 (1995). https:\/\/doi.org\/10.1016\/0969-6016(95)00010-5","journal-title":"Int. Trans. Oper. Res."},{"key":"6_CR11","series-title":"Lecture Notes in Networks and Systems","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/978-3-030-85626-7_55","volume-title":"Intelligent and Fuzzy Techniques for Emerging Conditions and Digital Transformation","author":"O Dogan","year":"2022","unstructured":"Dogan, O., Alkaya, A.F.: A novel method for prize collecting traveling salesman problem with time windows. In: Kahraman, C., Cebi, S., Cevik Onar, S., Oztaysi, B., Tolga, A.C., Sari, I.U. (eds.) INFUS 2021. LNNS, vol. 307, pp. 469\u2013476. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-85626-7_55"},{"key":"6_CR12","unstructured":"Fischetti, M., Toth, P.: Vehicle routing: methods and studies, chap. In: An Additive Approach for the Optimal Solution of the Prize Collecting Traveling Salesman Problem, pp. 319\u2013343, Elsevier (1988)"},{"key":"6_CR13","doi-asserted-by":"publisher","unstructured":"Goemans, M.X.: Combining approximation algorithms for the prize-collecting tsp (2009). https:\/\/doi.org\/10.48550\/ARXIV.0910.0553, https:\/\/arxiv.org\/abs\/0910.0553","DOI":"10.48550\/ARXIV.0910.0553"},{"issue":"2","key":"6_CR14","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM J. Comput. 24(2), 296\u2013317 (1995). https:\/\/doi.org\/10.1137\/S0097539793242618","journal-title":"SIAM J. Comput."},{"key":"6_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/b101971","volume-title":"The Traveling Salesman Problem and Its Variations","author":"G Gutin","year":"2007","unstructured":"Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and Its Variations. Springer, Boston (2007). https:\/\/doi.org\/10.1007\/b101971"},{"issue":"3","key":"6_CR16","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1002\/jgt.3190120314","volume":"12","author":"B Jackson","year":"1988","unstructured":"Jackson, B.: Some remarks on arc-connectivity, vertex splitting, and orientation in graphs and digraphs. J. Graph Theory 12(3), 429\u2013436 (1988). https:\/\/doi.org\/10.1002\/jgt.3190120314","journal-title":"J. Graph Theory"},{"issue":"3","key":"6_CR17","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s13675-016-0071-1","volume":"5","author":"R Lahyani","year":"2016","unstructured":"Lahyani, R., Khemakhem, M., Semet, F.: A unified matheuristic for solving multi-constrained traveling salesman problems with profits. EURO J. Comput. Optim. 5(3), 393\u2013422 (2016). https:\/\/doi.org\/10.1007\/s13675-016-0071-1","journal-title":"EURO J. Comput. Optim."},{"issue":"1","key":"6_CR18","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF01902503","volume":"28","author":"L Lov\u00e1sz","year":"1976","unstructured":"Lov\u00e1sz, L.: On some connectivity properties of Eulerian graphs. Acta Math. Acad. Sci. Hung. 28(1), 129\u2013138 (1976). https:\/\/doi.org\/10.1007\/BF01902503","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"6_CR19","doi-asserted-by":"publisher","unstructured":"Medeiros, Y.A.d., Goldbarg, M.C., Goldbarg, E.F.G.: Prize collecting traveling salesman problem with ridesharing. Revista de Inform\u00e1tica Te\u00f3rica e Aplicada 27(2), 13\u201329 (2020). https:\/\/doi.org\/10.22456\/2175-2745.94082","DOI":"10.22456\/2175-2745.94082"},{"key":"6_CR20","doi-asserted-by":"publisher","unstructured":"Nguyen, V.H., Nguyen, T.T.T.: Approximating the asymmetric profitable tour. Electr. Notes Discrete Math. 36, 907\u2013914 (2010). https:\/\/doi.org\/10.1016\/j.endm.2010.05.115","DOI":"10.1016\/j.endm.2010.05.115"},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","volume":"4","author":"C Papadimitriou","year":"1977","unstructured":"Papadimitriou, C.: Euclidean TSP is NP-complete. Theoret. Comput. Sci. 4, 237\u2013244 (1977)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/j.endm.2013.05.101","volume":"41","author":"O Pedro","year":"2013","unstructured":"Pedro, O., Saldanha, R., Camargo, R.: A tabu search approach for the prize collecting traveling salesman problem. Electr. Notes Discrete Math. 41, 261\u2013268 (2013). https:\/\/doi.org\/10.1016\/j.endm.2013.05.101","journal-title":"Electr. Notes Discrete Math."},{"key":"6_CR23","unstructured":"Rahbari, M., Jahed, A., Tehrani, N.S.: A hybrid simulated annealing algorithm for the prize collecting travelling salesman problem. In: 3rd International Conference on Industrial and Systems Engineering (ICISE 2017). Proceedings of 3rd International Conference on Industrial Engineering and Systems (ICISE 2017) (2017), https:\/\/hal.archives-ouvertes.fr\/hal-01962060"},{"key":"6_CR24","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni, S., Gonzales, T.: P-complete approximation problems. J. ACM 23, 555\u2013565 (1976)","journal-title":"J. ACM"},{"key":"6_CR25","doi-asserted-by":"publisher","unstructured":"Svensson, O., Tarnawski, J., V\u00e9gh, L.A.: A constant-factor approximation algorithm for the asymmetric traveling salesman problem. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pp. 204\u2013213. STOC 2018, Association for Computing Machinery, New York, NY, USA (2018). https:\/\/doi.org\/10.1145\/3188745.3188824","DOI":"10.1145\/3188745.3188824"},{"key":"6_CR26","doi-asserted-by":"publisher","unstructured":"Traub, V., Vygen, J.: An Improved Approximation Algorithm for ATSP, In: STOC 2020: 52nd Annual ACM SIGACT Symposium on Theory of Computing, pp. 1\u201313. Association for Computing Machinery, New York, NY, USA (2020). https:\/\/doi.org\/10.1145\/3357713.3384233","DOI":"10.1145\/3357713.3384233"},{"key":"6_CR27","doi-asserted-by":"publisher","unstructured":"Vansteenwegen, P., Gunawan, A.: Orienteering Problems: Models and Algorithms for Vehicle Routing Problems with Profits. Springer Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29746-6","DOI":"10.1007\/978-3-030-29746-6"}],"container-title":["Lecture Notes in Computer Science","Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22543-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T15:04:34Z","timestamp":1672671874000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22543-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031225420","9783031225437"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22543-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"3 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OPTIMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Petrovac","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montenegro","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"optima2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/agora.guru.ru\/display.php?conf=OPTIMA-2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}