{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:29:27Z","timestamp":1742938167197,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030053475"},{"type":"electronic","value":"9783030053482"}],"license":[{"start":{"date-parts":[[2018,12,31]],"date-time":"2018-12-31T00:00:00Z","timestamp":1546214400000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-05348-2_38","type":"book-chapter","created":{"date-parts":[[2018,12,31]],"date-time":"2018-12-31T02:24:51Z","timestamp":1546223091000},"page":"441-446","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Pseudo-pyramidal Tours and Efficient Solvability of the Euclidean Generalized Traveling Salesman Problem in Grid Clusters"],"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"}]}],"member":"297","published-online":{"date-parts":[[2018,12,31]]},"reference":[{"key":"38_CR1","doi-asserted-by":"publisher","unstructured":"Bhattacharya, B., \u0106usti\u0107, A., Rafiey, A., Rafiey, A., Sokol, V.: Approximation algorithms for generalized MST and TSP in grid clusters. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, D.-Z. (eds.) COCOA 2015. LNCS, vol. 9486, pp. 110\u2013125. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26626-8_9","DOI":"10.1007\/978-3-319-26626-8_9"},{"key":"38_CR2","doi-asserted-by":"publisher","unstructured":"Feremans, C., Grigoriev, A., Sitters, R.: The geometric generalized minimum spanning tree problem with grid clustering. 4OR 4(4), 319\u2013329 (2006). https:\/\/doi.org\/10.1007\/s10288-006-0012-6","DOI":"10.1007\/s10288-006-0012-6"},{"key":"38_CR3","doi-asserted-by":"publisher","unstructured":"Fischetti, M., Gonz\u00e1lez, J.J.S., Toth, P.: A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Oper. Res. 45(3), 378\u2013394 (1997). https:\/\/doi.org\/10.1287\/opre.45.3.378","DOI":"10.1287\/opre.45.3.378"},{"key":"38_CR4","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, US, Boston (2007)"},{"key":"38_CR5","doi-asserted-by":"publisher","unstructured":"Khachai, M.Y., Neznakhina, E.D.: Approximation schemes for the generalized traveling salesman problem. Proc. Steklov Inst. Math. 299(1), 97\u2013105 (2017). https:\/\/doi.org\/10.1134\/S0081543817090127","DOI":"10.1134\/S0081543817090127"},{"key":"38_CR6","doi-asserted-by":"publisher","unstructured":"Khachay, M., Neznakhina, K.: Towards a PTAS for the generalized TSP in grid cluster. AIP Conf. Proc. 1776(1), 050003 (2016). https:\/\/doi.org\/10.1063\/1.4965324","DOI":"10.1063\/1.4965324"},{"key":"38_CR7","unstructured":"Khachay, M., Pankratov, V., Khachay, D.: Attainable best guarantee for the accuracy of $$k$$-medians clustering in $$[0,1]$$. In: CEUR Workshop Proceedings 1987, pp. 322\u2013327 (2017). urn:nbn:de:0074-1987-8"},{"key":"38_CR8","doi-asserted-by":"publisher","unstructured":"Khachay, M., Neznakhina, K.: Generalized pyramidal tours for the generalized traveling salesman problem. Lecture Notes in Computer Science, vol. 10627, pp. 265\u2013277. Springer International Publishing, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71150-8_23","DOI":"10.1007\/978-3-319-71150-8_23"},{"key":"38_CR9","doi-asserted-by":"publisher","unstructured":"Khachay, M., Neznakhina, K.: Polynomial time solvable subclass of the generalized traveling salesman problem on grid clusters. In: van der Aalst, W.M.P., Ignatov, D.I., Khachay, M., Kuznetsov, S.O., Lempitsky, V., Lomazova, I.A., Loukachevitch, N., Napoli, A., Panchenko, A., Pardalos, P.M., Savchenko, A.V., Wasserman, S. (eds.) AIST 2017. LNCS, vol. 10716, pp. 346\u2013355. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73013-4_32","DOI":"10.1007\/978-3-319-73013-4_32"},{"key":"38_CR10","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."}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05348-2_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:56:32Z","timestamp":1710345392000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-05348-2_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,31]]},"ISBN":["9783030053475","9783030053482"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05348-2_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018,12,31]]},"assertion":[{"value":"31 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION 12","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":"Kalamata","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.caopt.com\/LION12\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}