{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T10:09:52Z","timestamp":1777889392187,"version":"3.51.4"},"reference-count":6,"publisher":"Elsevier BV","issue":"3-5","license":[{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"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":[[1998,10]]},"DOI":"10.1016\/s0167-6377(98)00043-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:14:29Z","timestamp":1027624469000},"page":"89-97","source":"Crossref","is-referenced-by-count":47,"title":["The partial constraint satisfaction problem: Facets and lifting theorems"],"prefix":"10.1016","volume":"23","author":[{"given":"Arie M.C.A.","family":"Koster","sequence":"first","affiliation":[]},{"given":"Stan P.M.van","family":"Hoesel","sequence":"additional","affiliation":[]},{"given":"Antoon W.J.","family":"Kolen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(98)00043-1_BIB1","unstructured":"K.I. Aardal, A. Hipolito, C.P.M. van Hoesel, B. Janssen, A branch-and-cut algorithm for the frequency assignment problem, Research Memorandum 96\/011, Maastricht University, 1996."},{"key":"10.1016\/S0167-6377(98)00043-1_BIB2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0167-6377(98)00043-1_BIB3","unstructured":"A.W.J. Kolen, A genetic algorithm for the partial binary constraint satisfaction problem: an application to a frequency assignment problem, Working paper, 1997."},{"key":"10.1016\/S0167-6377(98)00043-1_BIB4","doi-asserted-by":"crossref","unstructured":"R. M\u00fcller, A.S. Schulz. Transitive packing, in: W.H. Cunningham, S.T. McCormick, M. Queyranne (Eds.), Integer Programming and Combinatorial Optimization, pp. 430\u2013444, Vancouver, British Columbia, Canada, 1996. 5th Int. IPCO Conf.","DOI":"10.1007\/3-540-61310-2_32"},{"key":"10.1016\/S0167-6377(98)00043-1_BIB5","doi-asserted-by":"crossref","unstructured":"G.L. Nemhauser, L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988.","DOI":"10.1002\/9781118627372"},{"key":"10.1016\/S0167-6377(98)00043-1_BIB6","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01589101","article-title":"The boolean quadric polytope: some characteristics, facets and relatives","volume":"45","author":"Padberg","year":"1989","journal-title":"Math. Programming"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637798000431?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637798000431?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T04:54:42Z","timestamp":1555563282000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637798000431"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":6,"journal-issue":{"issue":"3-5","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["S0167637798000431"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(98)00043-1","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1998,10]]}}}