{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:44:57Z","timestamp":1760597097589,"version":"3.40.5"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Mathematics and Artificial Intelligence"],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1023\/a:1014496509129","type":"journal-article","created":{"date-parts":[[2002,12,29]],"date-time":"2002-12-29T19:13:07Z","timestamp":1041189187000},"page":"327-340","source":"Crossref","is-referenced-by-count":16,"title":["Coloration Neighbourhood Search With Forward Checking"],"prefix":"10.1007","volume":"34","author":[{"given":"Steven","family":"Prestwich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"394702_CR1","first-page":"288","volume":"1","author":"A.B. Baker","year":"1994","unstructured":"A.B. Baker, The hazards of fancy backtracking, in: Proceedings of the Twelfth National Conference on Artificial Intelligence, Vol. 1 (AAAI Press, 1994) pp. 288-293.","journal-title":"Proceedings of the Twelfth National Conference on Artificial Intelligence"},{"issue":"4","key":"394702_CR2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D. Br\u00e9laz","year":"1979","unstructured":"D. Br\u00e9laz, New methods to color the vertices of a graph, Communications of the ACM 22(4) (1979) 251-256.","journal-title":"Communications of the ACM"},{"key":"394702_CR3","unstructured":"J.C. Culberson, A. Beacham and D. Papp, Hiding our colors, in: Proceedings of the CP'95 Workshop on Studying and Solving Really Hard Problems, Cassis, France (1995)."},{"key":"394702_CR4","doi-asserted-by":"crossref","unstructured":"J.C. Culberson and F. Luo, Exploring the k-colorable landscape with iterated greedy, in: [11], pp. 245-284.","DOI":"10.1090\/dimacs\/026\/13"},{"issue":"1","key":"394702_CR5","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1023\/A:1009638304510","volume":"4","author":"A.E. Eiben","year":"1998","unstructured":"A.E. Eiben, J.K. van der Hauw and J.I. van Hemert, Graph coloring with adaptive evolutionary algorithms, Journal of Heuristics 4(1) (1998) 25-46.","journal-title":"Journal of Heuristics"},{"key":"394702_CR6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1613\/jair.1","volume":"1","author":"M.L. Ginsberg","year":"1993","unstructured":"M.L. Ginsberg, Dynamic backtracking, Journal of Artificial Intelligence Research 1 (1993) 25-46.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"394702_CR7","doi-asserted-by":"crossref","unstructured":"M.L. Ginsberg and D.A. McAllester, GSAT and dynamic backtracking, in: Proceedings of the Fourth International Conference on Principles of Knowledge Representation and Reasoning (Morgan Kaufmann, 1994) pp. 226-237.","DOI":"10.1016\/B978-1-4832-1452-8.50117-2"},{"key":"394702_CR8","doi-asserted-by":"crossref","unstructured":"F. Glover, M. Parker and J. Ryan, Coloring by tabu branch and bound, in: [11], pp. 285-307.","DOI":"10.1090\/dimacs\/026\/14"},{"key":"394702_CR9","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"R.M. Haralick","year":"1980","unstructured":"R.M. Haralick and G.L. Elliot, Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence 14 (1980) 268-277.","journal-title":"Artificial Intelligence"},{"key":"394702_CR10","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.39.3.378","volume":"3","author":"D.S. Johnson","year":"1991","unstructured":"D.S. Johnson, C.R. Aragon, L.A. McGeoch and C. Schevon, Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning, Operations Research 3 (1991) 378-406.","journal-title":"Operations Research"},{"key":"394702_CR11","doi-asserted-by":"crossref","unstructured":"D.S. Johnson and M.A. Trick (eds.), Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 26 (American Mathematical Society, 1996).","DOI":"10.1090\/dimacs\/026"},{"key":"394702_CR12","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1613\/jair.561","volume":"10","author":"D.E. Joslin","year":"1999","unstructured":"D.E. Joslin and D.P. Clements, Squeaky wheel optimization, Journal of Artificial Intelligence Research 10 (1999) 353-373.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"394702_CR13","doi-asserted-by":"crossref","unstructured":"N. Jussien and O. Lhomme, The path-repair algorithm, in: Proceedings of the Workshop on Large Scale Combinatorial Optimization and Constraints, Electronic Notes in Discrete Mathematics 4 (1999).","DOI":"10.1016\/S1571-0653(05)80102-7"},{"key":"394702_CR14","doi-asserted-by":"crossref","unstructured":"G. Lewandowski and A. Condon, Experiments with parallel graph coloring heuristics and applications of graph coloring, in: [11], pp. 309-334.","DOI":"10.1090\/dimacs\/026\/15"},{"key":"394702_CR15","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/ijoc.8.4.344","volume":"8","author":"A. Mehrotra","year":"1996","unstructured":"A. Mehrotra and M.A. Trick, A column generation approach to graph colouring, INFORMS Journal on Computing 8 (1996) 344-354.","journal-title":"INFORMS Journal on Computing"},{"issue":"1-3","key":"394702_CR16","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","volume":"58","author":"S. Minton","year":"1992","unstructured":"S. Minton, M.D. Johnston, A.B. Philips and P. Laird, Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems, Artificial Intelligence 58(1-3) (1992) 161-205.","journal-title":"Artificial Intelligence"},{"key":"394702_CR17","unstructured":"C. Morgenstern, Distributed coloration neighborhood search, in: [11], pp. 335-357."},{"key":"394702_CR18","doi-asserted-by":"crossref","unstructured":"G. Pesant and M. Gendreau, A view of local search in constraint programming, in: Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, Vol. 1118 (Springer-Verlag, 1996) pp. 353-366.","DOI":"10.1007\/3-540-61551-2_86"},{"key":"394702_CR19","doi-asserted-by":"crossref","unstructured":"S.D. Prestwich, Using an incomplete version of dynamic backtracking for graph colouring, in: Proceedings of the Workshop on Large Scale Combinatorial Optimization, Electronic Notes in Discrete Mathematics 1 (1998).","DOI":"10.1016\/S1571-0653(04)00007-1"},{"key":"394702_CR20","unstructured":"S.D. Prestwich, Stochastic local search in constrained spaces, in: Proceedings of the Practical Applications of Constraint Technology and Logic Programming, Practical Applications Company (2000) pp. 27-39."},{"key":"394702_CR21","doi-asserted-by":"crossref","unstructured":"S.D. Prestwich, A hybrid search architecture applied to hard random 3-SAT and low-autocorrelation binary sequences, in: Proceedings of the Sixth International Conference on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, Vol. 1894 (Springer-Verlag, 2000) pp. 337-352.","DOI":"10.1007\/3-540-45349-0_25"},{"key":"394702_CR22","unstructured":"S.D. Prestwich, Trading completeness for scalability: hybrid search for cliques and rulers, in: Proceedings of the Third International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Ashford, Kent, England (2001) pp. 159-174."},{"key":"394702_CR23","doi-asserted-by":"crossref","unstructured":"E.T. Richards and B. Richards, Non-systematic search and learning: an empirical study, in: Proceedings of the Fourth International Conference Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, Vol. 1520 (Springer-Verlag, 1998) pp. 370-384.","DOI":"10.1007\/3-540-49481-2_27"},{"key":"394702_CR24","unstructured":"A. Schaerf, Combining local search and look-ahead for scheduling and constraint satisfaction problems, in: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (Morgan Kaufmann, 1997) pp. 1254-1259."},{"key":"394702_CR25","doi-asserted-by":"crossref","unstructured":"P. Shaw, Using constraint programming and local search methods to solve vehicle routing problems, in: Proceedings of the Fourth International Conference on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, Vol. 1520 (Springer-Verlag, 1998) pp. 417-431.","DOI":"10.1007\/3-540-49481-2_30"},{"key":"394702_CR26","unstructured":"M. Yokoo, Weak-commitment search for solving constraint satisfaction problems, in: Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI Press, 1994) pp. 313-318."},{"key":"394702_CR27","unstructured":"N. Yugami, Y. Ohta and H. Hara, Improving repair-based constraint satisfaction methods by value propagation, in: Proceedings of the Twelfth National Conference on Artificial Intelligence, Vol. 1 (AAAI Press, 1994) pp. 344-349."},{"key":"394702_CR28","unstructured":"J. Zhang and H. Zhang, Combining local search and backtracking techniques for constraint satisfaction, in: Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Conference on Innovative Applications of Artificial Intelligence (AAAI Press \/ MIT Press, 1996) pp. 369-374."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1014496509129.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1014496509129\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1014496509129.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:36:17Z","timestamp":1747546577000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1014496509129"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["394702"],"URL":"https:\/\/doi.org\/10.1023\/a:1014496509129","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}