{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:01:39Z","timestamp":1725501699345},"publisher-location":"Boston, MA","reference-count":9,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387308586"},{"type":"electronic","value":"9780387359731"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-35973-1_1406","type":"book-chapter","created":{"date-parts":[[2008,1,8]],"date-time":"2008-01-08T23:27:24Z","timestamp":1199834844000},"page":"1173-1176","source":"Crossref","is-referenced-by-count":1,"title":["Traveling Salesman Problem (TSP)"],"prefix":"10.1007","author":[{"given":"Rhett","family":"Wilfahrt","sequence":"first","affiliation":[]},{"given":"Sangho","family":"Kim","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1406_CR1","unstructured":"Traveling Salesman Problem website supported by School of Industrial and Systems Engineering at Georgia Tech. http:\/\/www.tsp.gatech.edu\/"},{"key":"1406_CR2","unstructured":"Wikipedia, Traveling Salesman Problem. http:\/\/en.wikipedia.org\/"},{"key":"1406_CR3","unstructured":"Millennium Problems, The Clay Mathematics Institute of Cambridge, Massachusetts. http:\/\/www.claymath.org\/millennium\/"},{"key":"1406_CR4","doi-asserted-by":"crossref","unstructured":"Appletgate, D., Bixby, R., Chv\u00e1tal, V., Cook, W.: On the solution of traveling salesman problems. Documenta Mathematica Journal der Deutschen Mathematiker\u2010Vereinigung International Congress of Mathematicians, (1998)","DOI":"10.4171\/dms\/1-3\/62"},{"key":"1406_CR5","doi-asserted-by":"crossref","unstructured":"Fekete, S., Meijer, H., Rohe, A., Tietze, W.: Solving a\u00a0Hard problem to approximate an Easy one: heuristics for maximum matchings and maximum traveling salesman problems. J. Exp. Algorithm. (JEA)7, (2002)","DOI":"10.1145\/944618.944629"},{"key":"1406_CR6","doi-asserted-by":"crossref","unstructured":"Barvinok, A., Fekete, S., Johnson, D., Tamir, A., Woeginger, G., Woodroofe, R.: The geometric maximum traveling salesman problem. J. ACM (JACM) 50:(5)3, (2003)","DOI":"10.1145\/876638.876640"},{"key":"1406_CR7","doi-asserted-by":"crossref","unstructured":"Krolak, P., Felts, W., Marble, G.: A\u00a0man-machine approach toward solving the traveling salesman problem. Communications of the ACM 14:(5), (1971)","DOI":"10.1145\/362588.362593"},{"key":"1406_CR8","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C., Steiglitz, K.: Some complexity results for the Traveling Salesman Problem. Proceedings of the eighth annual ACM symposium on Theory of computing, May (1976)","DOI":"10.1145\/800113.803625"},{"key":"1406_CR9","volume-title":"Graph Theory 1736\u20131936","author":"N.L. Biggs","year":"1976","unstructured":"Biggs, N.L., Lloyd, E.K., Wilson, R.J.: Graph Theory 1736\u20131936. Clarendon Press, Oxford (1976)"}],"container-title":["Encyclopedia of GIS"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-35973-1_1406","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T18:53:46Z","timestamp":1684176826000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-35973-1_1406"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387308586","9780387359731"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-35973-1_1406","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}