{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:08:08Z","timestamp":1725804488958},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319118536"},{"type":"electronic","value":"9783319118543"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11854-3_41","type":"book-chapter","created":{"date-parts":[[2014,8,26]],"date-time":"2014-08-26T06:09:04Z","timestamp":1409033344000},"page":"477-482","source":"Crossref","is-referenced-by-count":2,"title":["Iteration Multilevel Method for the Travelling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Nikolay V.","family":"Starostin","sequence":"first","affiliation":[]},{"given":"Ilya V.","family":"Klyuev","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"41_CR1","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility Among Combinatorial Problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum, New York (1972)"},{"key":"41_CR2","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF01589105","volume":"45","author":"G. Carpaneto","year":"1989","unstructured":"Carpaneto, G., Fischetti, M., Toth, P.: New lower bounds for the symmetric travelling salesman problem. Mathematical Programming\u00a045, 233\u2013254 (1989)","journal-title":"Mathematical Programming"},{"key":"41_CR3","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1287\/mnsc.26.7.736","volume":"26","author":"G. Carpaneto","year":"1980","unstructured":"Carpaneto, G., Toth, P.: Some new branching and bounding criteria for the asymmetric travelling salesman problem. Management Science\u00a026, 736\u2013743 (1980)","journal-title":"Management Science"},{"key":"41_CR4","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem, Report 388, Graduate School of Industrial Admin (1976)"},{"key":"41_CR5","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1057\/jors.1979.77","volume":"30","author":"J. Norback","year":"1979","unstructured":"Norback, J., Love, R.: Heuristic for the Hamiltonian path problem in Euclidean two space. Journal of the Operational Research Society\u00a030, 363\u2013368 (1979)","journal-title":"Journal of the Operational Research Society"},{"key":"41_CR6","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1137\/0208045","volume":"8","author":"R.M. Karp","year":"1979","unstructured":"Karp, R.M.: A patching algorithm for the nonsymmetric traveling-salesman problem. SIAM Journal on Computing\u00a08, 561\u2013573 (1979)","journal-title":"SIAM Journal on Computing"},{"key":"41_CR7","doi-asserted-by":"publisher","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S. Lin","year":"1965","unstructured":"Lin, S.: Computer solutions of the traveling salesman problem. Bell Syst. Tech. J.\u00a044, 2245\u20132269 (1965)","journal-title":"Bell Syst. Tech. J."},{"key":"41_CR8","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An Effective Heuristic Algorithm for the TravelingSalesman Problem. Operations Res.\u00a021, 498\u2013516 (1973)","journal-title":"Operations Res."},{"key":"41_CR9","unstructured":"Grefenstette, J., et al.: Genetic algorithms for the traveling salesman problem. In: Proc. Intern. Conf. of Genetic Algorithms and their Applications, pp. 160\u2013165 (1985)"},{"key":"41_CR10","doi-asserted-by":"crossref","unstructured":"Dorigo, M., Stutzle, T.: Ant Colony Optimization. Massachusetts Institute of Technology (2004)","DOI":"10.7551\/mitpress\/1290.001.0001"},{"issue":"1","key":"41_CR11","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G. Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. SIAM J. Sci. Comput.\u00a020(1), 359\u2013392 (1998a)","journal-title":"SIAM J. Sci. Comput."},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell System Tech. (1970)","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"41_CR13","unstructured":"Walshaw, C.: A Multilevel Approach to the Graph Colouring Problem. Technical Report01\/IM\/69, Comp. Math. Sci., University Greenwich, London, UK ( May 2001b)"},{"key":"41_CR14","unstructured":"Traveling salesman problem library (TSPLIB) at the University of Heidelberg, \n                    \n                      http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/"}],"container-title":["Communications in Computer and Information Science","Knowledge-Based Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11854-3_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T17:53:02Z","timestamp":1558979582000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11854-3_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319118536","9783319118543"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11854-3_41","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2014]]}}}