{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T05:11:16Z","timestamp":1737349876285,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540649922"},{"type":"electronic","value":"9783540497950"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49795-1_19","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T18:47:38Z","timestamp":1186426058000},"page":"219-229","update-policy":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Heuristics for Improving the Non-oblivious Local Search for MaxSAT"],"prefix":"10.1007","author":[{"given":"G.","family":"De Ita","sequence":"first","affiliation":[]},{"given":"D. E.","family":"Pinto","sequence":"additional","affiliation":[]},{"given":"M.","family":"Nu\u00f1o","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,1,14]]},"reference":[{"issue":"3","key":"19_CR1","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0020-0190(95)00196-4","volume":"57","author":"P. Alimonti","year":"1996","unstructured":"Alimonti P., New local search approximation techniques for maximum generalized satisfiability problems, Information Procesing Letters, 57(3), 1996, 151\u2013156.","journal-title":"Information Procesing Letters"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Battiti R., Protasi M., Reactive search, a history-sensitive heuristic for MAX-SAT, to appear in ACM Journal of Experimental Algorithmics, 1997.","DOI":"10.1145\/264216.264220"},{"key":"19_CR3","unstructured":"Bellare M., Goldreich O., Sudan M., Free bits, PCP and non-approximability Towards tight results, Proc. 36th An. Symp. on Found. of Comp. Sc.(FOCS), 1995."},{"key":"19_CR4","unstructured":"Cheeeseman P., Kanesfsky B., Taylor W., Where the really hard problems are, Proceedings of the 12th IJCAI, pp. 163\u2013169. 1991."},{"key":"19_CR5","unstructured":"De Ita G., Morales G., Heur\u00edsticas para mejorar la b\u00fasqueda local en el tratamiento del problema de m\u00e1xima satisfactibilidad, (Iberamia96), 1996."},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Feige U., Goemans M., Approximating the value of two prover proof systems with applications to MAX 2SAT and MAX DICUT, Proceeding 32 Symp. on foundations of Computer Science, pp.182\u2013189, 1995.","DOI":"10.1109\/ISTCS.1995.377033"},{"key":"19_CR7","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1613\/jair.7","volume":"1","author":"I.P. Gent","year":"1993","unstructured":"Gent I.P., Walsh T., An empirical analysis of search in GSAT, Jour. of Artificial Intelligence Research 1, pp.47\u201359, 1993.","journal-title":"Jour. of Artificial Intelligence Research"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1109\/69.334864","volume":"6","author":"J. Gu","year":"1994","unstructured":"Gu J., Global optimization for Satisfactibility (SAT) Problem, IEEE Transaction on Knowledge and Data Engineering, Vol. 6, No.3, 361\u2013381, June 1994.","journal-title":"IEEE Transaction on Knowledge and Data Engineering"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF02241270","volume":"44","author":"P. Hansen","year":"1990","unstructured":"Hansen P., B Jaumard, Algorithms for the Maximum Satisfiability Problem, Computing 44, 279\u2013303, 1990.","journal-title":"Computing"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D. Johnson","year":"1974","unstructured":"Johnson D., Approximation algorithms for combinatorial problems, Journal of Computer and System Sciences 9, 256\u2013278, 1974.","journal-title":"Journal of Computer and System Sciences"},{"key":"19_CR11","unstructured":"Khanna Sanjeev, R. Motwani, M. Sudan and U. Vazirani, On Syntactic versus Computational Views of Approximability, TR95-023 ECCC 1995"},{"key":"19_CR12","unstructured":"Selman B., Kautz H., Cohen B., Local search strategies for Satisfiability testing, Second DIMACS Challenge on Cliques, Coloring, and Satisfiability, Oct. 1993."},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1006\/jagm.1994.1045","volume":"17","author":"M. Yannakakis","year":"1994","unstructured":"Yannakakis M., On the Approximation of Maximum Satisifiability, Journal of Algorithms, Vol. 17, pp. 475\u2013502, 1994.","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Progress in Artificial Intelligence \u2014 IBERAMIA 98"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/3-540-49795-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T04:42:23Z","timestamp":1737348143000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/10.1007\/3-540-49795-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540649922","9783540497950"],"references-count":13,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1007\/3-540-49795-1_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"14 January 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}