{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:36:39Z","timestamp":1760708199937},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642135194"},{"type":"electronic","value":"9783642135200"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13520-0_6","type":"book-chapter","created":{"date-parts":[[2010,6,12]],"date-time":"2010-06-12T12:10:33Z","timestamp":1276344633000},"page":"40-44","source":"Crossref","is-referenced-by-count":6,"title":["Improving the Held and Karp Approach with Constraint Programming"],"prefix":"10.1007","author":[{"given":"Pascal","family":"Benchimol","sequence":"first","affiliation":[]},{"given":"Jean-Charles","family":"R\u00e9gin","sequence":"additional","affiliation":[]},{"given":"Louis-Martin","family":"Rousseau","sequence":"additional","affiliation":[]},{"given":"Michel","family":"Rueher","sequence":"additional","affiliation":[]},{"given":"Willem-Jan","family":"van Hoeve","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","volume-title":"The Traveling Salesman Problem: A Computational Study","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":"6_CR2","volume-title":"The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization","author":"E. Balas","year":"1985","unstructured":"Balas, E., Toth, P.: Branch and Bound Methods. In: Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (eds.) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, ch. 10. Wiley, Chichester (1985)"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-540-72397-4_5","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"G. Dooms","year":"2007","unstructured":"Dooms, G., Katriel, I.: The \u201cnot-too-heavy spanning tree\u201d constraint. In: Van Hentenryck, P., Wolsey, L.A. (eds.) CPAIOR 2007. LNCS, vol.\u00a04510, pp. 59\u201370. Springer, Heidelberg (2007)"},{"key":"6_CR4","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.M.: The Traveling-Salesman Problem and Minimum Spanning Trees. Operations Research\u00a018, 1138\u20131162 (1970)","journal-title":"Operations Research"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/BF01584070","volume":"1","author":"M. Held","year":"1971","unstructured":"Held, M., Karp, R.M.: The Traveling-Salesman Problem and Minimum Spanning Trees: Part II. Mathematical Programming\u00a01, 6\u201325 (1971)","journal-title":"Mathematical Programming"},{"issue":"1","key":"6_CR6","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 Journal of Operational Research\u00a0126(1), 106\u2013130 (2000)","journal-title":"European Journal of Operational Research"},{"key":"6_CR7","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell System Tech. J.\u00a036, 1389\u20131401 (1957)","journal-title":"Bell System Tech. J."},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-540-68155-7_19","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"J.-C. R\u00e9gin","year":"2008","unstructured":"R\u00e9gin, J.-C.: Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint. In: Perron, L., Trick, M.A. (eds.) CPAIOR 2008. LNCS, vol.\u00a05015, pp. 233\u2013247. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13520-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T15:17:42Z","timestamp":1552576662000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13520-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135194","9783642135200"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13520-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}