{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:05:14Z","timestamp":1747548314948},"reference-count":20,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2000,12,1]],"date-time":"2000-12-01T00:00:00Z","timestamp":975628800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4611,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2000,12]]},"DOI":"10.1016\/s0166-218x(00)00249-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:56:47Z","timestamp":1027630607000},"page":"241-259","source":"Crossref","is-referenced-by-count":7,"title":["Solving satisfiability problems using elliptic approximations \u2013 effective branching rules"],"prefix":"10.1016","volume":"107","author":[{"given":"Joost P.","family":"Warners","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"van Maaren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00249-3_BIB1","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BF02127976","article-title":"A fast parallel SAT-solver \u2013 efficient workload balancing","volume":"17","author":"B\u00f6hm","year":"1996","journal-title":"Ann. Math. Artificial Intelligence"},{"key":"10.1016\/S0166-218X(00)00249-3_BIB2","doi-asserted-by":"crossref","unstructured":"S.A. Cook, The complexity of theorem proving procedures, Proceedings of the Third Annual ACM Symposium on the Theory of Computing, 1971, pp. 151\u2013158.","DOI":"10.1145\/800157.805047"},{"key":"10.1016\/S0166-218X(00)00249-3_BIB3","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/368273.368557","article-title":"A machine program for theorem proving","volume":"5","author":"Davis","year":"1962","journal-title":"Comm. ACM"},{"key":"10.1016\/S0166-218X(00)00249-3_BIB4","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1145\/321033.321034","article-title":"A computing procedure for quantification theory","volume":"7","author":"Davis","year":"1960","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(00)00249-3_BIB5","doi-asserted-by":"crossref","unstructured":"O. Dubois, P. Andre, Y. Boufkhad, J. Carlier, SAT versus UNSAT, in: Johnson and Trick [10], pp. 415\u2013436.","DOI":"10.1090\/dimacs\/026\/20"},{"key":"10.1016\/S0166-218X(00)00249-3_BIB6","doi-asserted-by":"crossref","unstructured":"A. Van Gelder, Y.K. Tsuji, Satisfiability testing with more reasoning and less guessing, in: Johnson and Trick [10], pp. 559\u2013586.","DOI":"10.1090\/dimacs\/026\/27"},{"issue":"3","key":"10.1016\/S0166-218X(00)00249-3_BIB7","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1109\/69.334864","article-title":"Global optimization for satisfiability (SAT) problem","volume":"6","author":"Gu","year":"1994","journal-title":"IEEE Trans. Knowledge Data Eng."},{"issue":"3","key":"10.1016\/S0166-218X(00)00249-3_BIB8","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF00881805","article-title":"Branching rules for satisfiability","volume":"15","author":"Hooker","year":"1195","journal-title":"J. Automated Reasoning"},{"key":"10.1016\/S0166-218X(00)00249-3_BIB9","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BF01531077","article-title":"Solving propositional satisfiability problems","volume":"1","author":"Jeroslow","year":"1990","journal-title":"Ann. Math. Artificial Intelligence"},{"key":"10.1016\/S0166-218X(00)00249-3_BIB10","series-title":"Cliques, Coloring and Satisfiability: Second DIMACS implementation challenge, DIMACS Series in Discrete Mathematics and Computer Science, Vol. 26","author":"Johnson","year":"1996"},{"key":"10.1016\/S0166-218X(00)00249-3_BIB11","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF02283686","article-title":"Computational experience with an interior point algorithm on the satisfiability problem","volume":"25","author":"Kamath","year":"1990","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0166-218X(00)00249-3_BIB12","doi-asserted-by":"crossref","unstructured":"H. Van Maaren, Elliptic approximations of propositional formulae, Discrete Appl. Math. 96\u201397 (1999) 223\u2013244.","DOI":"10.1016\/S0166-218X(99)00041-4"},{"key":"10.1016\/S0166-218X(00)00249-3_BIB13","series-title":"Satisfiability Problem: Theory and Applications, DIMACS Series in Discrete Mathematics and Computer Science, Vol. 35","first-page":"677","article-title":"On the use of second-order derivatives for the satisfiability problem","author":"Van Maaren","year":"1997"},{"key":"10.1016\/S0166-218X(00)00249-3_BIB14","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/S0166-218X(00)00263-8","article-title":"Bounds and fast approximation algorithms for binary quadratic optimization problems with application to MAX 2SAT","volume":"107","author":"Van Maaren","year":"2000","journal-title":"Disc. Appl. Math."},{"key":"10.1016\/S0166-218X(00)00249-3_BIB15","unstructured":"H. Van Maaren, J.P. Warners, Solving satisfiability problems using elliptic approximations \u2013 a note on volumes and weights, Technical Report 98-32, Department of Technical Mathematics and Informatics, Faculty of Information Technology and Systems, Delft University of Technology, Delft, The Netherlands, 1998."},{"key":"10.1016\/S0166-218X(00)00249-3_BIB16","unstructured":"D. Mitchell, B. Selman, H. Levesque, Hard and easy distributions of SAT problems, Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92), San Jose, CA, 1992, pp. 459\u2013465."},{"key":"10.1016\/S0166-218X(00)00249-3_BIB17","unstructured":"G. Strang, Linear Algebra and its Applications, 3rd Edition, Harcourt Brace Jovanovich, 1988."},{"issue":"2","key":"10.1016\/S0166-218X(00)00249-3_BIB18","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1111\/1467-9574.00076","article-title":"A nonlinear approach to a class of combinatorial optimization problems","volume":"52","author":"Warners","year":"1998","journal-title":"Statist. Neerlandica"},{"key":"10.1016\/S0166-218X(00)00249-3_BIB19","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/S0166-218X(99)00135-3","article-title":"Recognition of tractable satisfiability problems through balanced polynomial representations","volume":"99","author":"Warners","year":"2000","journal-title":"Discrete Appl. Math."},{"issue":"1\u20133","key":"10.1016\/S0166-218X(00)00249-3_BIB20","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0166-218X(96)00139-4","article-title":"A potential reduction approach to the frequency assignment problem","volume":"78","author":"Warners","year":"1997","journal-title":"Discrete Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002493?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002493?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T22:50:40Z","timestamp":1555800640000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00002493"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,12]]},"references-count":20,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2000,12]]}},"alternative-id":["S0166218X00002493"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00249-3","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,12]]}}}