{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:48:08Z","timestamp":1749124088747},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540586012"},{"type":"electronic","value":"9783540490326"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58601-6_87","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:37:30Z","timestamp":1330274250000},"page":"21-39","source":"Crossref","is-referenced-by-count":14,"title":["Nogood backmarking with min-conflict repair in constraint satisfaction and optimization"],"prefix":"10.1007","author":[{"given":"Yuejun","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Richards","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barry","family":"Richards","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"E. Aarts, P. van Laarhoven, J. Lenstra & N. Ulder (1994) A computational study of local search algorithms for job-shop scheduling ORSA Journal on Computing, Vol 6, No 2.","DOI":"10.1287\/ijoc.6.2.118"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"R. Battiti & G. Techiolli (1994) The reactive tabu search ORSA Journal on Computing Vol 6, No 2.","DOI":"10.1287\/ijoc.6.2.126"},{"key":"3_CR3","unstructured":"P. Cheesman, B. Kenesky & M. Taylor (1991) Where the really hard problems are IJCAI 91."},{"key":"3_CR4","unstructured":"R. Dechter (1990) Learning while searching in constraint satisfaction problems AAAI 90."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"G. Dueck & T. Scheuer (1990) Threshold accepting \u2014 a general purpose optimization algorithm Journal of computational physics 90.","DOI":"10.1016\/0021-9991(90)90201-B"},{"key":"3_CR6","unstructured":"M. Fox & N. Sadeh (1992) Why is scheduling difficult \u2014 a CSP perspective ECAI 92."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"M. Ginsberg (1993) Dynamic backtracking Electronic Journal of Al Research 1.","DOI":"10.1613\/jair.1"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"M. Ginsberg & D. McAllester (1994) Dynamic backtracking and GSAT KR'94.","DOI":"10.1016\/B978-1-4832-1452-8.50117-2"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"A. Hertz & D. de Werra (1987) Using tabu search techniques for graph colouring Computing 39.","DOI":"10.1007\/BF02239976"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"S. Kirkpatrick, C.D. Gelatt & M.P. Vecchi (1983) Optimization by simulated annealing Science 220","DOI":"10.1126\/science.220.4598.671"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"A. Mackwotth (1977) Consistency in networks of relations AI 8.","DOI":"10.1016\/0004-3702(77)90007-8"},{"key":"3_CR12","unstructured":"F. Maruyama, Y. Minoda, S. Sawada, Y. Takizawa & N. Kawato (1991) Solving combinatorial constraint satisfaction and optimization problems using sufficient conditions for constraint violation ISAI 4."},{"key":"3_CR13","unstructured":"P. Morris (1993) The breakout method for escaping from local minima AAAI 93."},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"S. Minton, M. Johnson, A. Philips & P. Laird (1992) Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems, Artificial Intelligence 58.","DOI":"10.1016\/0004-3702(92)90007-K"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"B. Nadel (1989) Constraint satisfaction algorithms Computational Intelligence Vol 8, No 4.","DOI":"10.1111\/j.1467-8640.1989.tb00328.x"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"T. Schiex & G. Verfaillie (1993) No-good recording for static and dynamic constraint satisfaction problems.","DOI":"10.1142\/S0218213094000108"},{"key":"3_CR17","unstructured":"N. Schraudolph (1991) Genetic algorithms software survey \u2014 overview Genetic Algorithm Digest 5 (34)."},{"key":"3_CR18","unstructured":"B. Selman, H. Levesque & D. Mitchell (1992) A new method for solving hard satisfiability problem AAAI 92."},{"key":"3_CR19","unstructured":"B. Selman & H. Kautz (1993) Domain independent extensions to GSATIJCAI 93."},{"key":"3_CR20","unstructured":"H. Taha (1992) Operations Research \u2014 an introduction Macmillan Publishing Company."},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"M. Zweben, E. Davis, B. Daun & M. Deale (1993) Scheduling and rescheduling with iterative repair IEEE transactions on Systems, MAN and Cybernetics, Vol 23 No 6.","DOI":"10.1109\/21.257756"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58601-6_87.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T08:11:54Z","timestamp":1640938314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58601-6_87"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540586012","9783540490326"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-58601-6_87","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}