{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T20:25:55Z","timestamp":1725222355123},"reference-count":20,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[2008,5,1]],"date-time":"2008-05-01T00:00:00Z","timestamp":1209600000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":1939,"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":[[2008,5]]},"DOI":"10.1016\/j.dam.2007.08.036","type":"journal-article","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T22:04:10Z","timestamp":1195077850000},"page":"1754-1779","source":"Crossref","is-referenced-by-count":7,"title":["Sums of squares based approximation algorithms for MAX-SAT"],"prefix":"10.1016","volume":"156","author":[{"given":"H.","family":"van Maaren","sequence":"first","affiliation":[]},{"given":"L.","family":"van Norden","sequence":"additional","affiliation":[]},{"given":"M.J.H.","family":"Heule","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.dam.2007.08.036_bib1","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/s001860400377","article-title":"On semidefinite programming relaxations for the satisfiability problem","volume":"60","author":"Anjos","year":"2004","journal-title":"Math. Methods Oper. Res."},{"issue":"3","key":"10.1016\/j.dam.2007.08.036_bib2","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1007\/s10107-003-0495-2","article-title":"An improved semidefinite programming relaxation for the satisfiability problem","volume":"102","author":"Anjos","year":"2005","journal-title":"Math. Programming"},{"key":"10.1016\/j.dam.2007.08.036_bib3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/SAT190001","article-title":"Semidefinite optimization approaches for satisfiability and maximum-satisfiability problems","volume":"1","author":"Anjos","year":"2005","journal-title":"J. Satisfiability Boolean Modeling Comput."},{"issue":"2","key":"10.1016\/j.dam.2007.08.036_bib4","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1137\/S1052623497328008","article-title":"Solving large-scale sparse semidefinite programs for combinatorial optimization","volume":"10","author":"Benson","year":"2000","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.dam.2007.08.036_bib5","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/BF02771790","article-title":"There are significantly more nonnegative polynomials than sums of squares","volume":"153","author":"Blekherman","year":"2005","journal-title":"Israel J. Math."},{"key":"10.1016\/j.dam.2007.08.036_bib6","unstructured":"B. Borchers, CSDP: a C library for semidefinite programming, Technical Report, New Mexico Tech, 1997."},{"issue":"4","key":"10.1016\/j.dam.2007.08.036_bib7","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1023\/A:1009725216438","article-title":"A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems","volume":"2","author":"Borchers","year":"1999","journal-title":"J. Combin. Optim."},{"key":"10.1016\/j.dam.2007.08.036_bib8","doi-asserted-by":"crossref","unstructured":"E. de Klerk, Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications, Applied Optimization Series, vol. 65, Kluwer Academic Publishers, Dordrecht, 2002.","DOI":"10.1007\/b105286"},{"key":"10.1016\/j.dam.2007.08.036_bib9","doi-asserted-by":"crossref","unstructured":"E. de Klerk, J.P. Warners, Semidefinite programming relaxations for MAX 2-SAT and 3-SAT: computational perspectives, in: P.M. Pardalos, A. Migdalas, R.E. Burkard (Eds.), Combinatorial and Global Optimization, Series on Applied Optimization, vol. 14, World Scientific Publishers, Singapore, 2002.","DOI":"10.1142\/9789812778215_0012"},{"key":"10.1016\/j.dam.2007.08.036_bib10","series-title":"Proceedings of the Third Israel Symposium on Theory of Computing and Systems","first-page":"182","article-title":"Approximating the value of two prover proof systems, with applications to MAX2SAT and MAXDICUT","author":"Feige","year":"1995"},{"key":"10.1016\/j.dam.2007.08.036_bib11","unstructured":"K. Fujisawa, M. Kojima, K. Nakata, M. Yamashita, SDPA (Semidefinite Programming Algorithm): user's manual, Research Reports on Information Sciences, Series B: Operations Research B 308, Department of Information Sciences, Tokyo Institute of Technology, Oh-Okayama, Meguro-ku, Tokyo, Japan, 2002."},{"issue":"6","key":"10.1016\/j.dam.2007.08.036_bib12","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","article-title":"Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming","volume":"42","author":"Goemans","year":"1995","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/j.dam.2007.08.036_bib13","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1145\/502090.502098","article-title":"Some optimal inapproximability results","volume":"48","author":"H\u00c5stad","year":"2001","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/j.dam.2007.08.036_bib14","series-title":"Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science","article-title":"A 7\/8-approximation algorithm for MAX 3SAT?","author":"Karloff","year":"1997"},{"key":"10.1016\/j.dam.2007.08.036_bib15","series-title":"The Art of Computer Programming, Vol. 2: Seminumerical Algorithms","author":"Knuth","year":"1969"},{"key":"10.1016\/j.dam.2007.08.036_bib16","series-title":"Proceedings of the Ninth Integer Programming and Combinatorial Optimization Conference","first-page":"67","article-title":"Improved rounding techniques for the MAX-2-SAT and MAX-DI-CUT problems","author":"Lewin","year":"2002"},{"issue":"2","key":"10.1016\/j.dam.2007.08.036_bib17","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s10107-003-0387-5","article-title":"Semidefinite programming relaxations for semialgebraic problems","volume":"96","author":"Parrilo","year":"2003","journal-title":"Math. Programming Ser. B"},{"issue":"3","key":"10.1016\/j.dam.2007.08.036_bib18","doi-asserted-by":"crossref","DOI":"10.1512\/iumj.1993.42.42045","article-title":"Positive polynomials on compact semi-algebraic sets","volume":"42","author":"Putinar","year":"1993","journal-title":"Indiana Univ. Math. J."},{"key":"10.1016\/j.dam.2007.08.036_bib19","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","article-title":"Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones","volume":"11\u201312","author":"Sturm","year":"1999","journal-title":"Optim. Methods Software"},{"key":"10.1016\/j.dam.2007.08.036_bib20","series-title":"Proceedings of 13th SODA","first-page":"496","article-title":"Computer assisted proof of optimal approximability results","author":"Zwick","year":"2002"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0700385X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0700385X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,28]],"date-time":"2020-04-28T04:12:35Z","timestamp":1588047155000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X0700385X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5]]},"references-count":20,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2008,5]]}},"alternative-id":["S0166218X0700385X"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2007.08.036","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2008,5]]}}}