{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:56:34Z","timestamp":1770994594253,"version":"3.50.1"},"reference-count":31,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[1998,4]]},"DOI":"10.1016\/s0377-2217(97)00294-4","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:55:41Z","timestamp":1052769341000},"page":"599-623","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":75,"title":["A tabu search approach to the constraint satisfaction problem as a general problem solver"],"prefix":"10.1016","volume":"106","author":[{"given":"Koji","family":"Nonobe","sequence":"first","affiliation":[]},{"given":"Toshihide","family":"Ibaraki","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00294-4_BIB1","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/BF01588309","article-title":"A note on some computationally difficult set covering problems","volume":"18","author":"Avis","year":"1980","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(97)00294-4_BIB2","first-page":"37","article-title":"Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study","volume":"12","author":"Balas","year":"1980","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(97)00294-4_BIB3","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1287\/ijoc.6.2.126","article-title":"The reactive tabu search","volume":"6","author":"Battiti","year":"1994","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(97)00294-4_BIB4","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0377-2217(87)90141-X","article-title":"An algorithm for set covering problem","volume":"31","author":"Beasley","year":"1987","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00294-4_BIB5","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/0377-2217(92)90077-M","article-title":"A survey of algorithms for the generalized assignment problem","volume":"60","author":"Cattrysse","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00294-4_BIB6","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0377-2217(94)90338-7","article-title":"A set partitioning heuristic for the generalized assignment problem","volume":"72","author":"Cattrysse","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00294-4_BIB7","series-title":"A genetic algorithm for the generalised assignment problem","author":"Chu","year":"1995"},{"key":"10.1016\/S0377-2217(97)00294-4_BIB8","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/0377-2217(94)90009-4","article-title":"A tabu search algorithm for computing an operational timetable","volume":"76","author":"Costa","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00294-4_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(87)90002-6","article-title":"Network-based heuristics for constraint-satisfaction problems","volume":"34","author":"Decher","year":"1988","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0377-2217(97)00294-4_BIB10","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1016\/0305-0548(91)90001-8","article-title":"A GRASP for a difficult single machine scheduling problem","volume":"18","author":"Feo","year":"1991","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(97)00294-4_BIB11","series-title":"Metaheuristics in Combinatorial Optimization","article-title":"Genetic and hybrid algorithms for graph coloring","author":"Fleurent","year":"1996"},{"key":"10.1016\/S0377-2217(97)00294-4_BIB12","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/322290.322292","article-title":"A sufficient condition for backtrack-free search","volume":"29","author":"Freuder","year":"1982","journal-title":"Journal of the Association for computing Machinery"},{"key":"10.1016\/S0377-2217(97)00294-4_BIB13","series-title":"Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI)","first-page":"4","article-title":"Complexity of K-tree structured constraint satisfaction problems","author":"Freuder","year":"1990"},{"key":"10.1016\/S0377-2217(97)00294-4_BIB14","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/BFb0120689","article-title":"Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems","volume":"2","author":"Fulkerson","year":"1974","journal-title":"Mathematical Programming Study"},{"key":"10.1016\/S0377-2217(97)00294-4_BIB15","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search \u2014 Part I","volume":"1","author":"Glover","year":"1989","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(97)00294-4_BIB16","article-title":"Tabu search fundamentals and uses","author":"Glover","year":"1995"},{"key":"10.1016\/S0377-2217(97)00294-4_BIB17","doi-asserted-by":"crossref","first-page":"1108","DOI":"10.1109\/21.247892","article-title":"Local search for satisfiability (SAT) problem","volume":"23","author":"Gu","year":"1993","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"10.1016\/S0377-2217(97)00294-4_BIB18","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0377-2217(91)90321-L","article-title":"Tabu search for large scale timetabling problems","volume":"54","author":"Hertz","year":"1991","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00294-4_BIB19","first-page":"436","article-title":"Nurse scheduling problem in Japan","volume":"41","author":"Ikegami","year":"1996","journal-title":"Communications of the Operations Research Society of Japan"},{"key":"10.1016\/S0377-2217(97)00294-4_BIB20","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1287\/opre.42.4.677","article-title":"A greedy randomized adaptive search procedure for the two-partition problem","volume":"42","author":"Laguna","year":"1994","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00294-4_BIB21","series-title":"Meta Heuristics: Theory and Applications","first-page":"467","article-title":"Probabilistic move selection in tabu search for zero-one mixed integer programming problems","author":"L\u00f8kketangen","year":"1996"},{"key":"10.1016\/S0377-2217(97)00294-4_BIB22","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0377-2217(94)90401-4","article-title":"A surrogate heuristic for set covering problems","volume":"79","author":"Lorena","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00294-4_BIB23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6377(95)00034-H","article-title":"Solving hard set covering problems","volume":"18","author":"Mannino","year":"1995","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(97)00294-4_BIB24","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/0004-3702(92)90007-K","article-title":"Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems","volume":"58","author":"Minton","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0377-2217(97)00294-4_BIB25","series-title":"Proceedings of International Symposium on Cooperative Data base Systems for Advanced Applications","first-page":"448","article-title":"Database queries as combinatorial optimization problems","author":"Miyazaki","year":"1996"},{"key":"10.1016\/S0377-2217(97)00294-4_BIB26","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF01720977","article-title":"Heuristics for the generalised assignment problem: simulated annealing and tabu search approaches","volume":"17","author":"Osman","year":"1995","journal-title":"OR Spektrum"},{"key":"10.1016\/S0377-2217(97)00294-4_BIB27","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1016\/0305-0548(93)90105-R","article-title":"A heuristic-based computerized nurse scheduling system","volume":"20","author":"Randhawa","year":"1993","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(97)00294-4_BIB28","series-title":"Proceedings of the thirteenth National Conference on Artificial Intelligence (AAAI) and the eighth Innovate Applications of Artificial Intelligence (IAAI)","first-page":"363","article-title":"Tabu search techniques for large high-school timetabling problems","author":"Schaerf","year":"1996"},{"key":"10.1016\/S0377-2217(97)00294-4_BIB29","series-title":"Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI)","first-page":"440","article-title":"A new method for solving hard satisfiability problems","author":"Selman","year":"1992"},{"key":"10.1016\/S0377-2217(97)00294-4_BIB30","series-title":"Foundations of Constraint Satisfaction","author":"Tsang","year":"1993"},{"key":"10.1016\/S0377-2217(97)00294-4_BIB31","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/64.482960","article-title":"A constraint-based high school scheduling system","volume":"11","author":"Yoshikawa","year":"1996","journal-title":"IEEE Expert"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797002944?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797002944?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T11:52:56Z","timestamp":1759837976000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797002944"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":31,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["S0377221797002944"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00294-4","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A tabu search approach to the constraint satisfaction problem as a general problem solver","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0377-2217(97)00294-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1998 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}