{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T15:59:40Z","timestamp":1649001580535},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,6,30]],"date-time":"2015-06-30T00:00:00Z","timestamp":1435622400000},"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":["Optim Lett"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s11590-015-0914-3","type":"journal-article","created":{"date-parts":[[2015,6,29]],"date-time":"2015-06-29T07:31:23Z","timestamp":1435563083000},"page":"1203-1220","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On a new edge function on complete weighted graphs and its application for locating Hamiltonian cycles of small weight"],"prefix":"10.1007","volume":"10","author":[{"given":"Panayotis E.","family":"Nastou","sequence":"first","affiliation":[]},{"given":"Vassilis","family":"Papadinas","sequence":"additional","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]},{"given":"Yannis C.","family":"Stamatiou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,30]]},"reference":[{"key":"914_CR1","unstructured":"Burkard, R.E.: Quadratic Assignment Problems. Handbook of Combinatorial Optimization, Second Edition 5, 2741\u20132814 (2005)"},{"key":"914_CR2","unstructured":"Pardalos, P.M., Wolkowicz, H., Editors, Quadratic Assignment and Related Problems AMS|DIMACS Series Vol 16 (1994)"},{"key":"914_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3155-2","volume-title":"Nonlinear assignment problems: algorithms and applications (combinatorial optimization)","author":"PM Pardalos","year":"2000","unstructured":"Pardalos, P.M., Pitsoulis, L.: Nonlinear assignment problems: algorithms and applications (combinatorial optimization). Kluwer Academic Publishers, Dordrecht (2000). Please check and confirm that the publisher location is updated correctly"},{"key":"914_CR4","unstructured":"Chen, J., Xia, G.: Complexity Issues on PTAS. Handbook of combinatorial optimization, Second Edition 2, 723\u2013746 (2005)"},{"key":"914_CR5","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni, S., Gonzales, T.: P-complete approximation problems. JACM 23, 555\u2013565 (1976)","journal-title":"JACM"},{"issue":"5","key":"914_CR6","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM 45(5), 753\u2013782 (1998)","journal-title":"J. ACM"},{"key":"914_CR7","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem. In: Traub, J.F. (ed.) Symposium on new directions and recent results in algorithms and complexity, page 441. Academic Press, NY (1976)"},{"key":"914_CR8","doi-asserted-by":"crossref","unstructured":"Garey, M.R., Graham, R.L., Johnson, D.S.: Some NP-complete geometric problems. In: Proceeding 8th ACM Symposium on Theory of Computing, pp. 10\u201322 (1976)","DOI":"10.1145\/800113.803626"},{"key":"914_CR9","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1057\/palgrave.jors.2600392","volume":"48","author":"F Glover","year":"1997","unstructured":"Glover, F., Punnen, A.: The traveling salesman problem: new solvable cases and linkages with the development of approximation algorithms. J. Oper. Res. Soc. 48, 502\u2013510 (1997)","journal-title":"J. Oper. Res. Soc."},{"key":"914_CR10","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0166-218X(01)00195-0","volume":"117","author":"G Gutin","year":"2002","unstructured":"Gutin, G., Yeo, A., Zverovich, A.: Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP. Disc. Appl. Math. 117, 81\u201386 (2002)","journal-title":"Disc. Appl. Math."},{"key":"914_CR11","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations, advances in cmputing research","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of computer computations, advances in cmputing research, pp. 85\u2013103. Plenum Press, New York (1972)"},{"key":"914_CR12","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1287\/moor.2.3.209","volume":"2","author":"RM Karp","year":"1977","unstructured":"Karp, R.M.: Probabilistic analysis of partitioning algorithms for the TSP in the plane. Math. Oper. Res. 2, 209\u2013224 (1977)","journal-title":"Math. Oper. Res."},{"key":"914_CR13","volume-title":"The traveling salesman problem","author":"EL Lawler","year":"1985","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: The traveling salesman problem. John Wiley, New York (1985)"},{"key":"914_CR14","volume-title":"Introduction to combinatorics","author":"WD Wallis","year":"2011","unstructured":"Wallis, W.D., George, J.C.: Introduction to combinatorics. Chapman and Hall\/CRC-Press, London (2011)"},{"key":"914_CR15","unstructured":"Samples of TSP Library in http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95\/"},{"key":"914_CR16","doi-asserted-by":"crossref","first-page":"1298","DOI":"10.1137\/S0097539796309764","volume":"28","author":"J Mitchell","year":"1999","unstructured":"Mitchell, J.: Guillotine subdivisions approximate polygonal subdivisions: a simple polynomial-time approximation scheme for geometric TSP, $$k$$ k -MST, and related problems. SIAM J. Comp. 28, 1298\u20131309 (1999)","journal-title":"SIAM J. Comp."},{"key":"914_CR17","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","volume":"4","author":"CH Papadimitriou","year":"1977","unstructured":"Papadimitriou, C.H.: Euclidean TSP is NP-complete. Theo. Comp. Sci. 4, 237\u2013244 (1977)","journal-title":"Theo. Comp. Sci."},{"key":"914_CR18","doi-asserted-by":"crossref","unstructured":"Rao, S., Smith, W.: Approximating geometrical graphs via \u201cspanners\u201d and \u201cbanyans\u201d. In: Proc. 30th Annual ACM Symposium on Theory of Computing, pp. 540\u2013550 (1998)","DOI":"10.1145\/276698.276868"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0914-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0914-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0914-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:42Z","timestamp":1559409102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0914-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,30]]},"references-count":18,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["914"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0914-3","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,30]]}}}