{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:30:47Z","timestamp":1725474647382},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540488224"},{"type":"electronic","value":"9783540488248"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11922377_8","type":"book-chapter","created":{"date-parts":[[2006,12,5]],"date-time":"2006-12-05T11:21:13Z","timestamp":1165317673000},"page":"86-97","source":"Crossref","is-referenced-by-count":6,"title":["Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP"],"prefix":"10.1007","author":[{"given":"Boris","family":"Goldengorin","sequence":"first","affiliation":[]},{"given":"Gerold","family":"J\u00e4ger","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Molitor","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-3886-0","volume-title":"Digraphs: Theory, Algorithms and Applications","author":"J. Bang-Jensen","year":"2002","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications. Springer, London (2002)"},{"key":"8_CR2","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.\u00a0Oper.\u00a0Res.\u00a0129, 555\u2013568 (2001)","journal-title":"European J.\u00a0Oper.\u00a0Res."},{"key":"8_CR3","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, Groningen, The Netherlands (2005), \n                    \n                      http:\/\/som.eldoc.ub.rug.nl\/reports\/themeA\/2005\/05A11\/05A11.pdf"},{"key":"8_CR4","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":"8_CR5","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":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-540-30559-0_19","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"B. Goldengorin","year":"2004","unstructured":"Goldengorin, B., Sierksma, G., Turkensteen, M.: Tolerance Based Algorithms for the ATSP. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 222\u2013234. Springer, Heidelberg (2004)"},{"key":"8_CR7","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/978-1-4757-2807-1_4","volume-title":"Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search","author":"H.J. Greenberg","year":"1998","unstructured":"Greenberg, H.J.: An annotated bibliography for post-solution analysis in mixed integer and combinatorial optimization. In: Woodruff, D.L. (ed.) Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search, pp. 97\u2013148. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"8_CR8","doi-asserted-by":"publisher","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. Discrete Appl. Math.\u00a0117, 81\u201386 (2002)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"8_CR9","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."},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M. Held","year":"1970","unstructured":"Held, M., Karp, R.: The Traveling-Salesman Problem and Minimum Spanning Trees. Oper. Res.\u00a018, 1138\u20131162 (1970)","journal-title":"Oper. Res."},{"key":"8_CR11","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, 106\u2013130 (2000)","journal-title":"European J. Oper. Res."},{"key":"8_CR12","first-page":"445","volume-title":"The Traveling Salesman Problem and Its Variations Experimental, ch. 10","author":"D.S. Johnson","year":"2002","unstructured":"Johnson, D.S., Gutin, G., McGeoch, L.A., Yeo, A., Zhang, W., Zverovich, A.: analysis of heuristics for the ATSP. In: Gutin, G., Punnen, A.P. (eds.) The Traveling Salesman Problem and Its Variations Experimental, ch. 10, pp. 445\u2013489. Kluwer, Dordrecht (2002)"},{"key":"8_CR13","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":"8_CR14","first-page":"1","volume-title":"Algorithms and Complexity: New Directions and Recent Results","author":"R.M. Karp","year":"1976","unstructured":"Karp, R.M.: The probabilistic analysis of some combinatorial search algorithms. In: Traub, J.F. (ed.) Algorithms and Complexity: New Directions and Recent Results, pp. 1\u201319. Academic Press, New York (1976)"},{"key":"8_CR15","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 non-symmetric traveling salesman problem. SIAM J. Comput.\u00a08, 561\u2013573 (1979)","journal-title":"SIAM J. Comput."},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0166-218X(91)90044-W","volume":"30","author":"M. Libura","year":"1991","unstructured":"Libura, M.: Sensitivity analysis for minimum hamiltonian path and traveling salesman problems. Discrete Appl. Math.\u00a030, 197\u2013211 (1991)","journal-title":"Discrete Appl. Math."},{"key":"8_CR17","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB \u2013 a Traveling Salesman Problem Library. ORSA J. Comput.\u00a03, 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"key":"8_CR18","unstructured":"Turkensteen, M., Ghosh, D., Goldengorin, B., Sierksma, G.: Tolerance-Based Branch and Bound Algorithms. In: Maroto, C., Esmap, S.L., et al. (eds.) Proceedings of a EURO conference for young OR researches and practitioners, ORP3 2005, Valencia, Spain, September 6-10, pp. 171\u2013182 (2005)"},{"key":"8_CR19","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/j.ejor.2004.09.015","volume":"169","author":"A. Volgenant","year":"2006","unstructured":"Volgenant, A.: An addendum on sensitivity analysis of the optimal assignment. European J. Oper. Res.\u00a0169, 338\u2013339 (2006)","journal-title":"European J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Combinatorial and Algorithmic Aspects of Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11922377_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:44:58Z","timestamp":1619509498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11922377_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540488224","9783540488248"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11922377_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}