{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:36:55Z","timestamp":1750307815850,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,7,12]],"date-time":"2008-07-12T00:00:00Z","timestamp":1215820800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,7,12]]},"DOI":"10.1145\/1389095.1389214","type":"proceedings-article","created":{"date-parts":[[2008,7,22]],"date-time":"2008-07-22T13:46:39Z","timestamp":1216734399000},"page":"605-606","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["A Tabu history driven crossover operator design for memetic algorithm applied to Max-2SAT-problems"],"prefix":"10.1145","author":[{"given":"M.","family":"Borschbach","sequence":"first","affiliation":[{"name":"University of M\u00fcnster, Germany"}]},{"given":"A.","family":"Exeler","sequence":"additional","affiliation":[{"name":"University of M\u00fcnster, Germany"}]}],"member":"320","published-online":{"date-parts":[[2008,7,12]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"SAT-based decision procedures for automated reasoning: a unifying perspective","author":"Armando A.","year":"2002","unstructured":"A. Armando , C. Castellini , E. Giunchiglia , F. Giunchiglia , and A. Tacchella . SAT-based decision procedures for automated reasoning: a unifying perspective , 2002 .]] A. Armando, C. Castellini, E. Giunchiglia, F. Giunchiglia, and A. Tacchella. SAT-based decision procedures for automated reasoning: a unifying perspective, 2002.]]"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90002-4"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/646483.691738"},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of Advances of Computer Application and COmputational Science (ACACOS), In: Selected Paper from the Conference in Hangzhou","author":"Borschbach M.","year":"2008","unstructured":"M. Borschbach and A. Exeler . A search agent for a Max-2SAT memetic algorithm approach . In Proceedings of Advances of Computer Application and COmputational Science (ACACOS), In: Selected Paper from the Conference in Hangzhou 2008 .]] M. Borschbach and A. Exeler. A search agent for a Max-2SAT memetic algorithm approach. In Proceedings of Advances of Computer Application and COmputational Science (ACACOS), In: Selected Paper from the Conference in Hangzhou 2008.]]"},{"key":"e_1_3_2_1_5_1","volume-title":"Indian International Conference on Artificial Intelligence (IICAI)-07","author":"Boughaci D.","year":"2007","unstructured":"D. Boughaci , B. Benhamou , and H. Drias . Iga: An improved genetic algorithm for Max-SAT problems . In Indian International Conference on Artificial Intelligence (IICAI)-07 2007 .]] D. Boughaci, B. Benhamou, and H. Drias.Iga: An improved genetic algorithm for Max-SAT problems. In Indian International Conference on Artificial Intelligence (IICAI)-07 2007.]]"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/026\/29"},{"key":"e_1_3_2_1_8_1","volume-title":"A study of genetic algorithms to find approximate solutions to hard 3cnf problems","author":"Frank J.","year":"1994","unstructured":"J. Frank . A study of genetic algorithms to find approximate solutions to hard 3cnf problems , 1994 .]] J. Frank. A study of genetic algorithms to find approximate solutions to hard 3cnf problems, 1994.]]"},{"key":"e_1_3_2_1_9_1","volume-title":"Computers and Intractability","author":"Garey M.R.","year":"1990","unstructured":"M.R. Garey and D.S. Johnson . Computers and Intractability ; A Guide to the Theory of NP-Completeness W.H. Freeman & Co. , New York, NY, USA, 1990 .]] M.R. Garey and D.S. Johnson. Computers and Intractability; A Guide to the Theory of NP-Completeness W.H. Freeman & Co., New York, NY, USA, 1990.]]"},{"key":"e_1_3_2_1_10_1","first-page":"28","volume-title":"National Conference on Artificial Intelligence","author":"Gent I.P.","year":"1993","unstructured":"I.P. Gent and T. Walsh . Towards an understanding of hill-climbing procedures for SAT . In National Conference on Artificial Intelligence pages 28 -- 33 , 1993 .]] I.P. Gent and T. Walsh. Towards an understanding of hill-climbing procedures for SAT. In National Conference on Artificial Intelligence pages 28--33, 1993.]]"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2006.14.2.223"},{"key":"e_1_3_2_1_12_1","volume-title":"A parallel grasp for Max-SAT problems","author":"Pardalos P.","year":"1996","unstructured":"P. Pardalos , L. Pitsoulis , and M. Resende . A parallel grasp for Max-SAT problems , 1996 .]] P. Pardalos, L. Pitsoulis, and M. Resende. A parallel grasp for Max-SAT problems, 1996.]]"},{"key":"e_1_3_2_1_13_1","volume-title":"SAT","author":"Zhang H.","year":"2004","unstructured":"H. Zhang , D. Li , and H. Shen . A sat based scheduler for tournament schedules . In SAT 2004 .]] H. Zhang, D. Li, and H. Shen. A sat based scheduler for tournament schedules. In SAT 2004.]]"}],"event":{"name":"GECCO08: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"location":"Atlanta GA USA","acronym":"GECCO08"},"container-title":["Proceedings of the 10th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1389095.1389214","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1389095.1389214","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:57:41Z","timestamp":1750255061000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1389095.1389214"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,12]]},"references-count":13,"alternative-id":["10.1145\/1389095.1389214","10.1145\/1389095"],"URL":"https:\/\/doi.org\/10.1145\/1389095.1389214","relation":{},"subject":[],"published":{"date-parts":[[2008,7,12]]},"assertion":[{"value":"2008-07-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}