{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T01:53:18Z","timestamp":1775440398593,"version":"3.50.1"},"publisher-location":"Providence, Rhode Island","reference-count":0,"publisher":"American Mathematical Society","isbn-type":[{"value":"9780821804797","type":"print"},{"value":"9780821870808","type":"print"},{"value":"9781470439934","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997,12,9]]},"DOI":"10.1090\/dimacs\/035\/14","type":"book-chapter","created":{"date-parts":[[2017,4,26]],"date-time":"2017-04-26T22:32:55Z","timestamp":1493245975000},"page":"537-572","source":"Crossref","is-referenced-by-count":9,"title":["Surrogate constraint analysis\u2014new heuristics and learning schemes for satisfiability problems"],"prefix":"10.1090","author":[{"given":"Arne","family":"Lokketangen","sequence":"first","affiliation":[]},{"given":"Fred","family":"Glover","sequence":"additional","affiliation":[]}],"member":"14","container-title":["DIMACS Series in Discrete Mathematics and Theoretical Computer Science","Satisfiability Problem: Theory and Applications"],"original-title":[],"language":"en","deposited":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T00:55:45Z","timestamp":1775436945000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ams.org\/dimacs\/035"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,12,9]]},"ISBN":["9780821804797","9780821870808","9781470439934"],"references-count":0,"URL":"https:\/\/doi.org\/10.1090\/dimacs\/035\/14","relation":{},"ISSN":["1052-1798","2472-4793"],"issn-type":[{"value":"1052-1798","type":"print"},{"value":"2472-4793","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,12,9]]}}}