{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T03:16:09Z","timestamp":1774926969046,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2002,2]]},"DOI":"10.1016\/s0167-6377(01)00114-6","type":"journal-article","created":{"date-parts":[[2002,10,11]],"date-time":"2002-10-11T17:46:03Z","timestamp":1034358363000},"page":"9-16","source":"Crossref","is-referenced-by-count":5,"title":["An efficient algorithm for a class of constraint satisfaction problems"],"prefix":"10.1016","volume":"30","author":[{"given":"Gerhard J.","family":"Woeginger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(01)00114-6_BIB1","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","article-title":"Linear time algorithms for testing satisfiability of propositional Horn formulae","volume":"1","author":"Dowling","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0167-6377(01)00114-6_BIB2","series-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0167-6377(01)00114-6_BIB3","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0166-218X(92)90294-K","article-title":"Polynomial graph-colorings","volume":"35","author":"Gutjahr","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0167-6377(01)00114-6_BIB4","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","article-title":"On the complexity of H-coloring","volume":"48","author":"Hell","year":"1990","journal-title":"J. Combin. Theory (B)"},{"key":"10.1016\/S0167-6377(01)00114-6_BIB5","doi-asserted-by":"crossref","first-page":"1179","DOI":"10.1137\/S0097539793251876","article-title":"Simple and fast algorithms for linear and integer programs with two variables per inequality","volume":"23","author":"Hochbaum","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-6377(01)00114-6_BIB6","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0004-3702(98)00022-8","article-title":"Constraints, consistency, and closure","volume":"101","author":"Jeavons","year":"1998","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0167-6377(01)00114-6_BIB7","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1145\/263867.263489","article-title":"Closure properties of constraints","volume":"44","author":"Jeavons","year":"1997","journal-title":"J. ACM"},{"key":"10.1016\/S0167-6377(01)00114-6_BIB8","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0004-3702(95)00107-7","article-title":"Tractable constraints on ordered domains","volume":"79","author":"Jeavons","year":"1995","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0167-6377(01)00114-6_BIB9","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1137\/0214016","article-title":"The computational complexity of simultaneous diophantine approximation problems","volume":"14","author":"Lagarias","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0167-6377(01)00114-6_BIB10","unstructured":"R.H. Moehring, M. Skutella, F. Stork, Scheduling with AND\/OR precedence constraints, Report No. 689\/2000, TU Berlin, Germany, 2000."},{"key":"10.1016\/S0167-6377(01)00114-6_BIB11","series-title":"Computational Complexity","author":"Papadimitriou","year":"1994"},{"key":"10.1016\/S0167-6377(01)00114-6_BIB12","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1023\/A:1008386713533","article-title":"Dynamic min\u2013max problems","volume":"9","author":"Schwiegelshohn","year":"1999","journal-title":"Discrete Event Dynamic Systems"},{"key":"10.1016\/S0167-6377(01)00114-6_BIB13","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0004-3702(92)90020-X","article-title":"A generic arc-consistency algorithm and its specializations","volume":"57","author":"van Hentenryck","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0167-6377(01)00114-6_BIB14","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0304-3975(95)00188-3","article-title":"The complexity of mean payoff games on graphs","volume":"158","author":"Zwick","year":"1996","journal-title":"Theoret. Comput. Sci."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637701001146?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637701001146?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T11:22:07Z","timestamp":1556536927000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637701001146"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S0167637701001146"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(01)00114-6","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}