{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T20:40:11Z","timestamp":1682368811213},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3947,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1016\/s0004-3702(02)00291-6","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T19:23:56Z","timestamp":1034018636000},"page":"1-17","source":"Crossref","is-referenced-by-count":3,"title":["An information-based neural approach to generic constraint satisfaction"],"prefix":"10.1016","volume":"142","author":[{"given":"Henrik","family":"J\u00f6nsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"S\u00f6derberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(02)00291-6_BIB001","first-page":"917","article-title":"A discrete stochastic neural network algorithm for constraint satisfaction problems","volume":"3","author":"Adorf","year":"1990"},{"issue":"4","key":"10.1016\/S0004-3702(02)00291-6_BIB002","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","article-title":"New methods to color the vertices of a graph","volume":"22","author":"Br\u00e9laz","year":"1979","journal-title":"Comm. ACM"},{"issue":"2","key":"10.1016\/S0004-3702(02)00291-6_BIB003","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/S0377-2217(87)80148-0","article-title":"Some experiments with simulated annealing for coloring graphs","volume":"32","author":"Chams","year":"1987","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0004-3702(02)00291-6_BIB004","series-title":"Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge, 1993, DIMACS Series in Discrete Mathematics and Theoretical Computer Science","first-page":"245","article-title":"Exploring the k-colorable landscape with iterated greedy","author":"Culberson","year":"1996"},{"key":"10.1016\/S0004-3702(02)00291-6_BIB005","first-page":"325","article-title":"Genet: A connectionist architecture for solving constraint satisfaction problems by iterative improvement","volume":"1","author":"Davenport","year":"1994"},{"key":"10.1016\/S0004-3702(02)00291-6_BIB006","series-title":"Satisfiability Problem: Theory and Applications, DIMACS Series in Discrete Mathematics and Theoretical Computer Science","year":"1997"},{"issue":"6","key":"10.1016\/S0004-3702(02)00291-6_BIB007","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1162\/neco.1992.4.6.805","article-title":"Complex scheduling with potts neural networks","volume":"4","author":"Gisl\u00e9n","year":"1992","journal-title":"Neural Comput."},{"issue":"1\u20132","key":"10.1016\/S0004-3702(02)00291-6_BIB008","article-title":"Special volume on Frontiers in Problem Solving: Phase Transitions and Complexity","volume":"81","author":"Hogg","year":"1996","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00291-6_BIB009","first-page":"357","article-title":"Applications of statistical mechanics to combinatorial search problems","volume":"2","author":"Hogg","year":"1995"},{"key":"10.1016\/S0004-3702(02)00291-6_BIB010","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","article-title":"Neural computation of decisions in optimization problems","volume":"52","author":"Hopfield","year":"1985","journal-title":"Biological Cybernetics"},{"issue":"3","key":"10.1016\/S0004-3702(02)00291-6_BIB011","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.39.3.378","article-title":"Optimization by simulated annealing: An experimental evaluation; Part II, Graph coloring and number partition","volume":"39","author":"Johnson","year":"1991","journal-title":"Oper. Res."},{"key":"10.1016\/S0004-3702(02)00291-6_BIB012","series-title":"Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challange, 1993, DIMACS Series in Discrete Mathematics and Theoretical Computer Science","year":"1996"},{"key":"10.1016\/S0004-3702(02)00291-6_BIB013","doi-asserted-by":"crossref","first-page":"1827","DOI":"10.1162\/08997660152469369","article-title":"An information based neural approach to constraint satisfaction","volume":"13","author":"J\u00f6nsson","year":"2001","journal-title":"Neural Comput."},{"key":"10.1016\/S0004-3702(02)00291-6_BIB014","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"issue":"6740","key":"10.1016\/S0004-3702(02)00291-6_BIB015","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1038\/22055","article-title":"Determining computational complexity from characteristic \u2018phase transitions\u2019","volume":"400","author":"Monasson","year":"1999","journal-title":"Nature"},{"issue":"2","key":"10.1016\/S0004-3702(02)00291-6_BIB016","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1162\/neco.1993.5.2.331","article-title":"Neural networks for optimization problems with inequality constraints\u2014the knapsack problem","volume":"5","author":"Ohlsson","year":"1993","journal-title":"Neural Comput."},{"key":"10.1016\/S0004-3702(02)00291-6_BIB017","series-title":"Computational Complexity","author":"Papadimitriou","year":"1994"},{"key":"10.1016\/S0004-3702(02)00291-6_BIB018","series-title":"Statistical Field Theory","author":"Parisi","year":"1988"},{"key":"10.1016\/S0004-3702(02)00291-6_BIB019","series-title":"The Handbook of Brain Research and Neural Networks","first-page":"617","article-title":"Neural optimization","author":"Peterson","year":"1998"},{"key":"10.1016\/S0004-3702(02)00291-6_BIB020","series-title":"Proceedings AAAI-94, Seattle, WA","first-page":"337","article-title":"Noise strategies for improving local search","author":"Selman","year":"1994"},{"issue":"1","key":"10.1016\/S0004-3702(02)00291-6_BIB021","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1103\/RevModPhys.54.235","article-title":"The potts model","volume":"54","author":"Wu","year":"1982","journal-title":"Review of Modern Physics"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370202002916?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370202002916?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,24]],"date-time":"2023-04-24T20:18:57Z","timestamp":1682367537000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370202002916"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S0004370202002916"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(02)00291-6","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}