{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:20:01Z","timestamp":1743117601332,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030218027"},{"type":"electronic","value":"9783030218034"}],"license":[{"start":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T00:00:00Z","timestamp":1560556800000},"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-21803-4_103","type":"book-chapter","created":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T22:03:24Z","timestamp":1560549804000},"page":"1043-1053","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Edges Elimination for Traveling Salesman Problem Based on Frequency $$K_5$$ s"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4029-4018","authenticated-orcid":false,"given":"Yong","family":"Wang","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,15]]},"reference":[{"key":"103_CR1","unstructured":"Johnson, D.S., McGeoch, L.-A.: The Traveling Salesman Problem and its Variations, Combinatorial Optimization. 1st edn. Springer Press, London (2004)"},{"issue":"1","key":"103_CR2","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","volume":"5","author":"R Karp","year":"1975","unstructured":"Karp, R.: On the computational complexity of combinatorial problems. Networks 5(1), 45\u201368 (1975)","journal-title":"Networks"},{"issue":"1","key":"103_CR3","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M Held","year":"1962","unstructured":"Held, M., Karp, R.: A dynamic programming approach to sequencing problems. J. Soc. Ind. Appl. Math 10(1), 196\u2013210 (1962)","journal-title":"J. Soc. Ind. Appl. Math"},{"issue":"1","key":"103_CR4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/321105.321111","volume":"9","author":"R Bellman","year":"1962","unstructured":"Bellman, R.: Dynamic programming treatment of the traveling salesman problem. J. ACM 9(1), 61\u201363 (1962)","journal-title":"J. ACM"},{"issue":"16","key":"103_CR5","doi-asserted-by":"crossref","first-page":"1815","DOI":"10.1016\/j.dam.2011.01.026","volume":"159","author":"E-D Klerk","year":"2011","unstructured":"Klerk, E.-D., Dobre, C.: A comparison of lower bounds for the symmetric circulant traveling salesman problem. Discret. Appl. Math 159(16), 1815\u20131826 (2011)","journal-title":"Discret. Appl. Math"},{"issue":"1","key":"103_CR6","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.orl.2008.09.006","volume":"37","author":"D Applegate","year":"2009","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V., Cook, W., Espinoza, D.-G., Goycoolea, M., Helsgaun, K.: Certification of an optimal TSP tour through 85900 cities. Oper. Res. Lett. 37(1), 11\u201315 (2009)","journal-title":"Oper. Res. Lett."},{"key":"103_CR7","volume-title":"Introduction to Algorithm","author":"H-C Thomas","year":"2006","unstructured":"Thomas, H.-C., Charles, E.-L., Ronald, L.-R., Clifford, S.: Introduction to Algorithm, 2nd edn. China Machine Press, Beijing (2006)","edition":"2"},{"key":"103_CR8","doi-asserted-by":"crossref","unstructured":"M\u00f6mke, T., Svensson, O.: Approximating graphic TSP by matchings. In: FOCS 2011, pp. 560\u2013569. IEEE, NY (2011)","DOI":"10.1109\/FOCS.2011.56"},{"issue":"1","key":"103_CR9","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1), 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"103_CR10","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1137\/050636036","volume":"36","author":"M Sharir","year":"2006","unstructured":"Sharir, M., Welzl, E.: On the number of crossing-free matchings, cycles, and partitions. SIAM J. Comput. 36(3), 695\u2013720 (2006)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"103_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2151171.2151181","volume":"8","author":"A Bj\u00f6rklund","year":"2012","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: The traveling salesman problem in bounded degree graphs. ACM T. Algorithms 8(2), 1\u201318 (2012)","journal-title":"ACM T. Algorithms"},{"issue":"2","key":"103_CR12","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1137\/140972925","volume":"29","author":"J-R Correa","year":"2015","unstructured":"Correa, J.-R., Larr\u00e9, O., Soto, J.-A.: TSP tours in cubic graphs: beyond 4\/3. SIAM J. Discret. Math. 29(2), 915\u2013939 (2015)","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"103_CR13","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s00453-012-9662-2","volume":"68","author":"G Borradaile","year":"2014","unstructured":"Borradaile, G., Demaine, E.-D., Tazari, S.: Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs. Algorithmica 68(2), 287\u2013311 (2014)","journal-title":"Algorithmica"},{"key":"103_CR14","doi-asserted-by":"crossref","unstructured":"Gharan, S.-O., Saberi, A.: The asymmetric traveling salesman problem on graphs with bounded genus. In: SODA 2011, pp. 23\u201325. ACM (2011)","DOI":"10.1137\/1.9781611973082.75"},{"issue":"4","key":"103_CR15","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1287\/opre.32.4.837","volume":"32","author":"R Jonker","year":"1984","unstructured":"Jonker, R., Volgenant, T.: Nonoptimal edges for the symmetric traveling salesman problem. Oper. Res. 32(4), 837\u2013846 (1984)","journal-title":"Oper. Res."},{"key":"103_CR16","doi-asserted-by":"crossref","unstructured":"Hougardy, S., Schroeder, R.-T.: Edges elimination in TSP instances. In: Kratsch, D., Todinca, I. (eds.) WG 2014. LNCS, vol. 8747, pp. 275\u2013286. Springer, Heidelberg (2014)","DOI":"10.1007\/978-3-319-12340-0_23"},{"key":"103_CR17","unstructured":"Taillard, \n                    \n                      \n                    \n                    $$\\acute{E}$$\n                  .-D., Helsgaun, K.: POPMUSIC for the traveling salesman problem. Eur. J. Oper. Res. 272(2), 420\u2013429 (2019)"},{"issue":"2","key":"103_CR18","doi-asserted-by":"crossref","first-page":"411","DOI":"10.7155\/jgaa.00400","volume":"20","author":"Y Wang","year":"2016","unstructured":"Wang, Y., Remmel, J.-B.: A binomial distribution model for the traveling salesman problem based on frequency quadrilaterals. J. Graph Algorithms Appl. 20(2), 411\u2013434 (2016)","journal-title":"J. Graph Algorithms Appl."},{"issue":"11","key":"103_CR19","doi-asserted-by":"crossref","first-page":"4470","DOI":"10.1007\/s10489-018-1222-2","volume":"48","author":"Y Wang","year":"2018","unstructured":"Wang, Y., Remmel, J.-B.: An iterative algorithm to eliminate edges for traveling salesman problem based on a new binomial distribution. Appl. Intell. 48(11), 4470\u20134484 (2018)","journal-title":"Appl. Intell."},{"issue":"12","key":"103_CR20","doi-asserted-by":"crossref","first-page":"5150","DOI":"10.1016\/j.eswa.2015.02.037","volume":"42","author":"Y Wang","year":"2015","unstructured":"Wang, Y.: An approximate method to compute a sparse graph for traveling salesman problem. Expert Syst. Appl. 42(12), 5150\u20135162 (2015)","journal-title":"Expert Syst. Appl."}],"container-title":["Advances in Intelligent Systems and Computing","Optimization of Complex Systems: Theory, Models, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21803-4_103","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T06:05:15Z","timestamp":1572588315000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-21803-4_103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,15]]},"ISBN":["9783030218027","9783030218034"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21803-4_103","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2019,6,15]]},"assertion":[{"value":"15 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WCGO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"World Congress on Global Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"8 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wcgo2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}