{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:43Z","timestamp":1725490243772},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735793"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73580-9_4","type":"book-chapter","created":{"date-parts":[[2007,8,23]],"date-time":"2007-08-23T01:52:00Z","timestamp":1187833920000},"page":"5-19","source":"Crossref","is-referenced-by-count":1,"title":["DFS-Tree Based Heuristic Search"],"prefix":"10.1007","author":[{"given":"Montserrat","family":"Abril","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miguel A.","family":"Salido","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Federico","family":"Barber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Dechter, R.: Constraint networks (survey). Encyclopedia Artificial Intelligence, 276\u2013285 (1992)"},{"key":"4_CR2","volume-title":"Constraint Processing","author":"R. Dechter","year":"2003","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)"},{"key":"4_CR3","unstructured":"Ezzahir, R., Bessiere, C., Belaissaoui, M., Bouyakhf, E.-H.: Dischoco: A platform for distributed constraint programming. In: DCR 2007. Proceedings of IJCAI-2007 Eighth International Workshop on Distributed Constraint Reasoning, pp. 16\u201327 (2007)"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Hendrickson, B., Leland, R.W.: A multi-level algorithm for partitioning graphs. Supercomputing (1995)","DOI":"10.1145\/224170.224228"},{"key":"4_CR5","unstructured":"Karypis, G., Kumar, V.: Using METIS and parMETIS (1995)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Karypis, G., Kumar, V.: A parallel algorithm for multilevel graph partitioning and sparse matrix ordering. Journal of Parallel and Distributed Computing, 71\u201395 (1998)","DOI":"10.1006\/jpdc.1997.1403"},{"key":"4_CR7","unstructured":"Sadeh, N., Fox, M.S.: Variable and value ordering heuristics for activity-based jobshop scheduling. In: Proc. of Fourth International Conference on Expert Systems in Production and Operations Management, pp. 134\u2013144 (1990)"},{"key":"4_CR8","unstructured":"Salido, M.A., Barber, F.: A constraint ordering heuristic for scheduling problems. In: Proceeding of the 1st Multidisciplinary International Conference on Scheduling: Theory and Applications, vol.\u00a02, pp. 476\u2013490 (2003)"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1109\/TEVC.2002.802449","volume":"6","author":"C. Solnon","year":"2002","unstructured":"Solnon, C.: Ants can solve constraint satisfaction problems. IEEE Transactions on Evalutionary Computation\u00a06, 347\u2013357 (2002)","journal-title":"IEEE Transactions on Evalutionary Computation"},{"key":"4_CR10","unstructured":"Stutzle, T.: Tabu search and iterated local search for constraint satisfaction problems, Technischer Bericht AIDA9711, FG Intellektik, TU Darmstadt (1997)"},{"key":"4_CR11","volume-title":"Foundation of Constraint Satisfaction","author":"E. Tsang","year":"1993","unstructured":"Tsang, E.: Foundation of Constraint Satisfaction. Academic Press, London and San Diego (1993)"},{"key":"4_CR12","unstructured":"Wallace, R., Freuder, E.: Ordering heuristics for arc consistency algorithms. In: Proc. of Ninth Canad. Conf. on A.I., pp. 163\u2013169 (1992)"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1023\/A:1010078712316","volume":"3","author":"M. Yokoo","year":"2000","unstructured":"Yokoo, M., Hirayama, K.: Algorithms for distributed constraint satisfaction: A review. Autonomous Agents and Multi-Agent Systems\u00a03, 185\u2013207 (2000)","journal-title":"Autonomous Agents and Multi-Agent Systems"}],"container-title":["Lecture Notes in Computer Science","Abstraction, Reformulation, and Approximation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73580-9_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T05:52:32Z","timestamp":1619502752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73580-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735793"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73580-9_4","relation":{},"subject":[]}}