{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:10:00Z","timestamp":1725516600655},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540850960"},{"type":"electronic","value":"9783540850977"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85097-7_20","type":"book-chapter","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T07:18:26Z","timestamp":1219130306000},"page":"211-224","source":"Crossref","is-referenced-by-count":8,"title":["Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order"],"prefix":"10.1007","author":[{"given":"Gerold","family":"J\u00e4ger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Molitor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","series-title":"A Computational Study","volume-title":"The Traveling Salesman Problem","author":"D.L. Applegate","year":"2006","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: The Traveling Salesman Problem. A Computational Study. Princeton University Press, Princeton (2006)"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/BF01584237","volume":"21","author":"D.P. Bertsekas","year":"1981","unstructured":"Bertsekas, D.P.: A New Algorithm for the Assignment Problem. Math. Program.\u00a021, 152\u2013171 (1981)","journal-title":"Math. Program."},{"issue":"8","key":"20_CR3","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1016\/j.artint.2006.02.005","volume":"170","author":"S. Climer","year":"2006","unstructured":"Climer, S., Zhang, W.: Cut-and-Solve: An Iterative Search Strategy for Combinatorial Optimization Problems. Artificial Intelligence\u00a0170(8), 714\u2013738 (2006)","journal-title":"Artificial Intelligence"},{"issue":"1-2","key":"20_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0166-218X(99)00172-9","volume":"100","author":"M. Dell\u2019Amico","year":"2000","unstructured":"Dell\u2019Amico, M., Toth, P.: Algorithms and Codes for Dense Assignment Problems: the State of the Art. Discrete Appl. Math.\u00a0100(1-2), 17\u201348 (2000)","journal-title":"Discrete Appl. Math."},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1093\/bioinformatics\/18.1.100","volume":"18","author":"K. Ellrott","year":"2002","unstructured":"Ellrott, K., Yang, C., Sladek, F.M., Jiang, T.: Identifying Transcription Factor Binding Sites Through Markov Chain Optimization. Bioinformatics\u00a018, 100\u2013109 (2002)","journal-title":"Bioinformatics"},{"key":"20_CR6","unstructured":"Fischer, F., Lau, A.: University of Chemnitz. Private Communication"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/S0377-2217(99)00468-3","volume":"129","author":"F. Glover","year":"2001","unstructured":"Glover, F., Gutin, G., Yeo, A., Zverovich, A.: Construction Heuristics for the Asymmetric TSP. European J. Oper. Res.\u00a0129, 555\u2013568 (2001)","journal-title":"European J. Oper. Res."},{"key":"20_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer, Dordrecht (1997)"},{"key":"20_CR9","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Bonn (1989)"},{"key":"20_CR10","first-page":"153","volume":"71","author":"A.V. Goldberg","year":"1995","unstructured":"Goldberg, A.V., Kennedy, R.: An Efficient Cost Scaling Algorithm for the Assignment Problem. Math. Program.\u00a071, 153\u2013177 (1995)","journal-title":"Math. Program."},{"key":"20_CR11","unstructured":"Goldengorin, B., J\u00e4ger, G.: How To Make a Greedy Heuristic for the Asymmetric Traveling Salesman Competitive. SOM Research Report 05A11, University of Groningen, The Netherlands (2005)"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/11775096_19","volume-title":"Algorithmic Aspects in Information and Management","author":"B. Goldengorin","year":"2006","unstructured":"Goldengorin, B., J\u00e4ger, G., Molitor, P.: Some Basics on Tolerances. In: Cheng, S.-W., Poon, C.K. (eds.) AAIM 2006. LNCS, vol.\u00a04041, pp. 194\u2013206. Springer, Heidelberg (2006)"},{"issue":"9","key":"20_CR13","doi-asserted-by":"publisher","first-page":"716","DOI":"10.3844\/jcssp.2006.716.734","volume":"2","author":"B. Goldengorin","year":"2006","unstructured":"Goldengorin, B., J\u00e4ger, G., Molitor, P.: Tolerances Applied in Combinatorial Optimization. J. Comput. Sci.\u00a02(9), 716\u2013734 (2006)","journal-title":"J. Comput. Sci."},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/11922377_8","volume-title":"Combinatorial and Algorithmic Aspects of Networking","author":"B. Goldengorin","year":"2006","unstructured":"Goldengorin, B., J\u00e4ger, G., Molitor, P.: Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP. In: Erlebach, T. (ed.) CAAN 2006. LNCS, vol.\u00a04235, pp. 86\u201397. Springer, Heidelberg (2006)"},{"key":"20_CR15","unstructured":"Grosse, I.: University of Halle-Wittenberg, Chair for Bioinformatics. Private Communication"},{"issue":"1","key":"20_CR16","first-page":"23","volume":"43","author":"G. Gutin","year":"2005","unstructured":"Gutin, G., Zverovich, A.: Evaluation of the Contract-or-Patch Heuristic for the Asymmetric TSP. INFOR\u00a043(1), 23\u201331 (2005)","journal-title":"INFOR"},{"issue":"1","key":"20_CR17","doi-asserted-by":"publisher","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. European J. Oper. Res.\u00a0126(1), 106\u2013130 (2000)","journal-title":"European J. Oper. Res."},{"key":"20_CR18","first-page":"445","volume-title":"The Traveling Salesman Problem and Its Variations","author":"D.S. Johnson","year":"2002","unstructured":"Johnson, D.S., Gutin, G., McGeoch, L.A., Yeo, A., Zhang, W., Zverovich, A.: Experimental Analysis of Heuristics for the ATSP. In: Gutin, G., Punnen, A.P. (eds.) The Traveling Salesman Problem and Its Variations, ch.\u00a010, pp. 445\u2013489. Kluwer, Dordrecht (2002)"},{"key":"20_CR19","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF02278710","volume":"38","author":"R. Jonker","year":"1987","unstructured":"Jonker, R., Volgenant, A.: A Shortest Augmenting Path Algorithm for Dense and Sparse Linear Assignment Problems. Computing\u00a038, 325\u2013340 (1987)","journal-title":"Computing"},{"key":"20_CR20","doi-asserted-by":"crossref","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":"20_CR21","first-page":"181","volume-title":"The Traveling Salesman Problem","author":"R.M. Karp","year":"1985","unstructured":"Karp, R.M., Steele, J.M.: Probabilistic Analysis of Heuristics. In: Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (eds.) The Traveling Salesman Problem, ch.\u00a06, pp. 181\u2013205. John Wiley & Sons, Chichester (1985)"},{"key":"20_CR22","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 Traveling-Salesman Problem. Oper. Res.\u00a021, 498\u2013516 (1973)","journal-title":"Oper. Res."},{"key":"20_CR23","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1137\/0206041","volume":"6","author":"D.J. Rosenkrantz","year":"1977","unstructured":"Rosenkrantz, D.J., Stearns, R.E., Lewis, P.M.: An Analysis of Several Heuristics for the Traveling Salesman Problem. SIAM J. Comput.\u00a06, 563\u2013581 (1977)","journal-title":"SIAM J. Comput."},{"key":"20_CR24","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1089\/cmb.2005.12.894","volume":"12","author":"X. Zhao","year":"2005","unstructured":"Zhao, X., Huang, H., Speed, T.P.: Finding Short DNA Motifs Using Permuted Markov Models. Journal of Computational Biology\u00a012, 894\u2013906 (2005)","journal-title":"Journal of Computational Biology"},{"key":"20_CR25","unstructured":"Source code of [1] (Concorde), \n                  \n                    http:\/\/www.tsp.gatech.edu\/concorde.html"},{"key":"20_CR26","unstructured":"Homepage of Cplex, \n                  \n                    http:\/\/www.ilog.com\/products\/optimization\/archive.cfm"},{"key":"20_CR27","unstructured":"Source code of [19], \n                  \n                    http:\/\/www.magiclogic.com\/assignment.html"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85097-7_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:41:00Z","timestamp":1619523660000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85097-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540850960","9783540850977"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85097-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}