{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T05:08:29Z","timestamp":1716959309826},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,12,6]],"date-time":"2014-12-06T00:00:00Z","timestamp":1417824000000},"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":["Constraints"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s10601-014-9178-2","type":"journal-article","created":{"date-parts":[[2014,12,5]],"date-time":"2014-12-05T07:22:16Z","timestamp":1417764136000},"page":"145-162","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["The salesman and the tree: the importance of search in CP"],"prefix":"10.1007","volume":"21","author":[{"given":"Jean-Guillaume","family":"Fages","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xavier","family":"Lorca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louis-Martin","family":"Rousseau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,6]]},"reference":[{"issue":"5","key":"9178_CR1","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1016\/j.dam.2005.06.011","volume":"154","author":"R Andrade","year":"2006","unstructured":"Andrade, R., Lucena, A., Maculan, N. (2006). Using Lagrangian dual information to generate degree constrained spanning trees. Discrete Applied Mathematics, 154(5), 703\u2013717.","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"9178_CR2","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s10601-012-9119-x","volume":"17","author":"P Benchimol","year":"2012","unstructured":"Benchimol, P., van Hoeve, W.J., R\u00e9gin, J.-C., Rousseau, L.-M., Rueher, M. (2012). Improved filtering for weighted circuit constraints. Constraints, 17(3), 205\u2013233.","journal-title":"Constraints"},{"key":"9178_CR3","unstructured":"Concorde TSP solver. http:\/\/www.tsp.gatech.edu\/concorde.html ."},{"issue":"1","key":"9178_CR4","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/net.20166","volume":"50","author":"AS da Cunha","year":"2007","unstructured":"da Cunha, A.S., & Lucena, A. (2007). Lower and upper bounds for the degree-constrained minimum spanning tree problem. Networks, 50(1), 55\u201366.","journal-title":"Networks"},{"key":"9178_CR5","unstructured":"da Cunha, A.S., & Lucena, A. (2008). A hybrid relax-and-cut\/branch and cut algorithm for the degree-constrained minimum spanning tree problem. Technical report, Universidade Federal do Rio de Janeiro."},{"key":"9178_CR6","doi-asserted-by":"crossref","unstructured":"Dooms, G., Deville, Y., Pierre, D. (2005). CP(Graph): Introducing a graph computation domain in constraint programming. In Principles and Practice of Constraint Programming, CP, vol. 3709, pp. 211\u2013225.","DOI":"10.1007\/11564751_18"},{"key":"9178_CR7","unstructured":"Focacci, F., Lodi, A., Milano, M. (1999). Cost-based domain filtering. In CP, volume 1713 of Lecture Notes in Computer Science, (pp. 189\u2013203): Springer."},{"issue":"4","key":"9178_CR8","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1023\/A:1014492408220","volume":"34","author":"F Focacci","year":"2002","unstructured":"Focacci, F., Lodi, A., Milano, M. (2002). Embedding relaxations in global constraints for solving TSP and TSPTW. Annals of Mathematics and Artificial Intelligence, 34(4), 291\u2013311.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"3\u20134","key":"9178_CR9","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1023\/A:1020589922418","volume":"7","author":"F Focacci","year":"2002","unstructured":"Focacci, F., Lodi, A., Milano, M. (2002). Optimization-oriented global constraints. Constraints, 7(3\u20134), 351\u2013365.","journal-title":"Constraints"},{"key":"9178_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10601-013-9148-0","volume":"19","author":"KG Francis","year":"2013","unstructured":"Francis, K.G., & Stuckey, P.J. (2013). Explaining circuit propagation. Constraints, 19, 1\u201329.","journal-title":"Constraints"},{"key":"9178_CR11","unstructured":"Maria, J., de la Banda, G., Stuckey, P.J., Wazny, J. (2003). Finding all minimal unsatisfiable subsets. In PPDP, pp. 32\u201343."},{"key":"9178_CR12","unstructured":"Haralick, R.M., & Elliott, G.L. (1979). Increasing tree search efficiency for constraint satisfaction problems. In: Proceedings of the 6th International Joint Conference on Artificial Intelligence - Vol. 1, IJCAI\u201979, (pp. 356\u2013364): Morgan Kaufmann Publishers Inc."},{"key":"9178_CR13","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","volume":"1","author":"M Held","year":"1971","unstructured":"Held, M., & Karp, R.M. (1971). The traveling-salesman problem and minimum spanning trees: Part II. Mathematical Programming, 1, 6\u201325.","journal-title":"Mathematical Programming"},{"issue":"1","key":"9178_CR14","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun, K. (2000). An effective implementation of the Lin-Kernighan traveling salesman heuristic. European Journal of Operational Research, 126(1), 106\u2013130.","journal-title":"European Journal of Operational Research"},{"issue":"18","key":"9178_CR15","doi-asserted-by":"crossref","first-page":"1592","DOI":"10.1016\/j.artint.2009.09.002","volume":"173","author":"C Lecoutre","year":"2009","unstructured":"Lecoutre, C., Sais, L., Tabary, S., Vidal, V. (2009). Reasoning from last conflict(s) in constraint programming. Artificial Intelligence, 173(18), 1592\u20131614.","journal-title":"Artificial Intelligence"},{"key":"9178_CR16","doi-asserted-by":"crossref","unstructured":"Le Pape, C., Perron, L., R\u00e9gin, J.-C., Shaw, P. (2002). Robust and parallel solving of a network design problem. In Principles and Practice of Constraint Programming, CP, vol. 2470, pp. 633\u2013648.","DOI":"10.1007\/3-540-46135-3_42"},{"key":"9178_CR17","unstructured":"R\u00e9gin, J.-C. (2004). Tutorial: Modeling problems in constraint programming. In Principles and Practice of Constraint Programming, CP."},{"key":"9178_CR18","doi-asserted-by":"crossref","unstructured":"R\u00e9gin, J.-C. (2008). Simpler and incremental consistency checking and arc consistency filtering algorithms for the weighted spanning tree constraint. In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR, vol. 5015, pp. 233\u2013247.","DOI":"10.1007\/978-3-540-68155-7_19"},{"key":"9178_CR19","doi-asserted-by":"crossref","unstructured":"R\u00e9gin, J.-C., Rousseau, L.-M., Rueher, M., van Hoeve, W.J. (2010). The weighted spanning tree constraint revisited. In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR, vol. 6140, pp. 287\u2013291.","DOI":"10.1007\/978-3-642-13520-0_31"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-014-9178-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-014-9178-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-014-9178-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:14:18Z","timestamp":1559243658000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-014-9178-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,6]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["9178"],"URL":"https:\/\/doi.org\/10.1007\/s10601-014-9178-2","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,6]]}}}