{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T22:25:06Z","timestamp":1768083906611,"version":"3.49.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031069000","type":"print"},{"value":"9783031069017","type":"electronic"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-06901-7_24","type":"book-chapter","created":{"date-parts":[[2022,5,27]],"date-time":"2022-05-27T00:22:30Z","timestamp":1653610950000},"page":"319-332","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Two-Stripe Symmetric Circulant TSP is in\u00a0P"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3516-2996","authenticated-orcid":false,"given":"Samuel C.","family":"Gutekunst","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6362-2048","authenticated-orcid":false,"given":"Billy","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1825-0097","authenticated-orcid":false,"given":"David P.","family":"Williamson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,27]]},"reference":[{"issue":"1","key":"24_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/BF02614311","volume":"79","author":"RE Burkard","year":"1997","unstructured":"Burkard, R.E.: Efficiently solvable special cases of hard combinatorial optimization problems. Math. Prog. 79(1), 55\u201369 (1997). https:\/\/doi.org\/10.1007\/BF02614311","journal-title":"Math. Prog."},{"key":"24_CR2","doi-asserted-by":"publisher","unstructured":"Burkard, R. E., De\u012dneko, V.G., van Dal, R., van der Veen, J.A., Woeginger, G.J.: Well-solvable special cases of the traveling salesman problem: a survey. SIAM Rev. 40(3), 496\u2013546 (1998). http:\/\/dx.doi.org\/10.1137\/S0036144596297514. https:\/\/doi.org\/10.1137\/S0036144596297514","DOI":"10.1137\/S0036144596297514"},{"key":"24_CR3","doi-asserted-by":"publisher","unstructured":"Burkard, R.E., Sandholzer, W.: Efficiently solvable special cases of bottleneck travelling salesman problems. Discrete Appl. Math. 32(1), 61\u201376 (1991). http:\/\/www.sciencedirect.com\/science\/article\/pii\/0166218X9190024Q. https:\/\/doi.org\/10.1016\/0166-218X(91)90024-Q","DOI":"10.1016\/0166-218X(91)90024-Q"},{"key":"24_CR4","doi-asserted-by":"publisher","unstructured":"Codenotti, B., Gerace, I., Vigna, S.: Hardness results and spectral techniques for combinatorial problems on circulant graphs. Linear Algebra Appl. 285(1), 123\u2013142 (1998). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S002437959810126X. https:\/\/doi.org\/10.1016\/S0024-3795(98)10126-X","DOI":"10.1016\/S0024-3795(98)10126-X"},{"key":"24_CR5","unstructured":"Gerace, I., Greco, F.: Bounds for the symmetric circulant traveling salesman problem. Rapporto Tecnico 4\/2006, Dipartimento de Matematica e Informatica, Universit\u00e0 di Perugia (2006)"},{"issue":"1","key":"24_CR6","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1017\/S0960129508006609","volume":"18","author":"I Gerace","year":"2008","unstructured":"Gerace, I., Greco, F.: The travelling salesman problem in symmetric circulant matrices with two stripes. Math. Struct. Comput. Sci. 18(1), 165\u2013175 (2008)","journal-title":"Math. Struct. Comput. Sci."},{"key":"24_CR7","unstructured":"Gilmore, P.C., Lawler, E.L., Shmoys, D.B.: Well-solved special cases. In: Lawler, E.L., Lenstra, J. K., Rinnooy Kan, A.H.G., Shmoys, D.B., (eds.) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, New York, pp. 87\u2013143. Wiley (1985)"},{"key":"24_CR8","doi-asserted-by":"publisher","unstructured":"Greco, F., Gerace, I.: The traveling salesman problem in circulant weighted graphs with two stripes. Electron. Notes Theor. Comput. Sci. 169, 99\u2013109 (2007). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1571066107000497. https:\/\/doi.org\/10.1016\/j.entcs.2006.07.032","DOI":"10.1016\/j.entcs.2006.07.032"},{"issue":"4","key":"24_CR9","doi-asserted-by":"publisher","first-page":"2452","DOI":"10.1137\/19M1245840","volume":"33","author":"SC Gutekunst","year":"2019","unstructured":"Gutekunst, S.C., Williamson, D.P.: Characterizing the integrality gap of the subtour LP for the circulant traveling salesman problem. SIAM J. Discrete Math. 33(4), 2452\u20132478 (2019)","journal-title":"SIAM J. Discrete Math."},{"key":"24_CR10","series-title":"Combinatorial Optimization","doi-asserted-by":"publisher","DOI":"10.1007\/0-306-48213-4_11","volume-title":"The Traveling Salesman Problem and Its Variations","author":"SN Kabadi","year":"2007","unstructured":"Kabadi, S.N.: Polynomially solvable cases of the TSP. In: Gutin, G., Punnen, A.P. (eds.) The Traveling Salesman Problem and Its Variations. Combinatorial Optimization, vol. 12. Springer, Boston (2007). https:\/\/doi.org\/10.1007\/0-306-48213-4_11"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley (1985)","DOI":"10.2307\/2582681"},{"key":"24_CR12","volume-title":"A Computational Introduction to Number Theory and Algebra","author":"V Shoup","year":"2009","unstructured":"Shoup, V.: A Computational Introduction to Number Theory and Algebra. Cambridge University Press, Cambridge (2009)"},{"key":"24_CR13","unstructured":"van der Veen, J.A.A., van Dal, R., Sieksma, G.: The symmetric circulant traveling salesman problem. Research Memorandum 429, Institute of Economic Research, Faculty of Economics, University of Groningen, (1991)"},{"key":"24_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735","volume-title":"The Design of Approximation Algorithms","author":"DP Williamson","year":"2011","unstructured":"Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press, New York (2011)"},{"issue":"1","key":"24_CR15","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0012-365X(96)00298-1","volume":"176","author":"QF Yang","year":"1997","unstructured":"Yang, Q.F., Burkard, R.E., \u00c7ela, E., Woeginger, G.J.: Hamiltonian cycles in circulant digraphs with two stripes. Discrete Math. 176(1), 233\u2013254 (1997)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06901-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,30]],"date-time":"2022-05-30T23:04:37Z","timestamp":1653951877000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06901-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031069000","9783031069017"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06901-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"27 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Eindhoven","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","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":"27 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ipco2022.com\/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":"93","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":"33","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":"35% - 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":"33","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)"}}]}}