{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:00:00Z","timestamp":1740099600373,"version":"3.37.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030386283"},{"type":"electronic","value":"9783030386290"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-38629-0_16","type":"book-chapter","created":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T09:05:05Z","timestamp":1579597505000},"page":"201-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Asymptotically Optimal Algorithms for the Prize-Collecting Traveling Salesman Problem on Random Inputs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1349-405X","authenticated-orcid":false,"given":"Edward Kh.","family":"Gimadi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9570-8519","authenticated-orcid":false,"given":"Oxana","family":"Tsidulko","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,22]]},"reference":[{"issue":"1","key":"16_CR1","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1137\/S009753979528826X","volume":"28","author":"B Awerbuch","year":"1999","unstructured":"Awerbuch, B., Azar, Y., Blum, A., Vempala, S.: New approximation guarantees for minimum-weight k-trees and prize-collecting salesmen. SIAM J. Comput. 28(1), 254\u2013262 (1999)","journal-title":"SIAM J. Comput."},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/BF01581256","volume":"59","author":"D Bienstock","year":"1993","unstructured":"Bienstock, D., Goemans, M., Simchi-Levi, D., Williamson, D.: A note on the prize collecting traveling salesman problem. Math. Program. 59, 413\u2013420 (1993)","journal-title":"Math. Program."},{"key":"16_CR3","first-page":"919","volume":"7","author":"S Climer","year":"2006","unstructured":"Climer, S., Zhang, W.: Rearrangement clustering: pitfalls, remedies, and applications. JMLR 7, 919\u2013943 (2006)","journal-title":"JMLR"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1023\/A:1018961208614","volume":"81","author":"M Dell\u2019Amico","year":"1998","unstructured":"Dell\u2019Amico, M., Maffioli, F., Sciomachen, A.: A Lagrangian heuristic for the Prize-Collecting Travelling Salesman Problem. Ann. Oper. Res. 81, 289\u2013305 (1998)","journal-title":"Ann. Oper. Res."},{"key":"16_CR5","unstructured":"Fischetti, M., Toth, P.: An additive approach for the optimal solution of the Prize-Collecting Travelling Salesman Problem. In: Golden, B.L., Assad, A.A. (eds.) Vehicle Routing: Methods and Studies, pp. 319\u2013343 (1988)"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/3-540-32539-5_45","volume-title":"Operations Research Proceedings 2005","author":"EK Gimadi","year":"2006","unstructured":"Gimadi, E.K.: On some probability inequalities for some discrete optimization problems. In: Haasis, H.D., Kopfer, H., Sch\u00f6nberger, J. (eds.) Operations Research Proceedings 2005, pp. 283\u2013289. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/3-540-32539-5_45"},{"issue":"2","key":"16_CR7","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1134\/S1990478909020070","volume":"3","author":"EK Gimadi","year":"2009","unstructured":"Gimadi, E.K., Le Gallou, A., Shakhshneyder, A.V.: Probabilistic analysis of an approximation algorithm for the traveling salesman problem on unbounded above instances. J. Appl. Ind. Math. 3(2), 207\u2013221 (2009)","journal-title":"J. Appl. Ind. Math."},{"key":"16_CR8","volume-title":"Extremal Problems on the Set of Permutations","author":"EK Gimadi","year":"2016","unstructured":"Gimadi, E.K., Khachay, M.Y.: Extremal Problems on the Set of Permutations. Ural Federal University, Ekaterinburg (2016). (in Russian)"},{"key":"16_CR9","series-title":"Combinatorial Optimization","doi-asserted-by":"publisher","DOI":"10.1007\/b101971","volume-title":"The Traveling Salesman Problem and Its Variations","year":"2007","unstructured":"Gutin, G., Punnen, A.P. (eds.): The Traveling Salesman Problem and Its Variations. Combinatorial Optimization, vol. 12. Springer, Boston (2007). \nhttps:\/\/doi.org\/10.1007\/b101971"},{"key":"16_CR10","unstructured":"Johnson, D.S., Minkoff, M., Phillips, S.: The prize collecting Steiner tree problem: theory and practice. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp 760\u2013769. Society for Industrial and Applied Mathematics (2000)"},{"key":"16_CR11","unstructured":"Paul, A., Freund D., Ferber A., Shmoys D.B., Williamson D.P.: Prize-collecting TSP with a budget constraint. In: 25th Annual European Symposium on Algorithms (ESA 2017), Leibniz International Proceedings in Informatics (LIPIcs), pp 62:1\u201362:14 (2017)"},{"issue":"5","key":"16_CR12","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1007\/s12038-007-0101-5","volume":"32","author":"SS Ray","year":"2007","unstructured":"Ray, S.S., Bandyopadhyay, S., Pal, S.K.: Gene ordering in partitive clustering using microarray expressions. J. Biosci. 32(5), 1019\u20131025 (2007)","journal-title":"J. Biosci."}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-38629-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,21]],"date-time":"2020-01-21T09:20:44Z","timestamp":1579598444000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-38629-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030386283","9783030386290"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-38629-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chania, Crete","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2019","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":"lion2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.lion13.pem.tuc.gr\/en\/home\/","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":"52","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":"38","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":"73% - 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","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","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}